Towards practical deterministic Write-All algorithms

B. S. Chlebus, G. Malewicz, S. Dobrev, A. Shvartsman, D. R. Kowalski, I. Vrto

Research output: Contribution to conferencePaper

15 Scopus citations

Abstract

A family of deterministic asynchronous Write-All algorithms were studied to analyze the properties of the set of permutations proposed by Kanellakis and Shvartsman. The efficiency of the algorithms was measured in terms of work acounted for all machine instructions executed by processors. It was found that the analytical results covered only a subset of the possible adversarial patterns of asynchrony. The analysis suggested that the proposed method yielded a faster construction of the Write-All algorithms compared to other methods.

Original languageEnglish (US)
Pages271-280
Number of pages10
StatePublished - Jan 1 2001
Externally publishedYes
Event13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001) - Crete Island, Greece
Duration: Jul 3 2001Jul 6 2001

Conference

Conference13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001)
CountryGreece
CityCrete Island
Period7/3/017/6/01

Keywords

  • Contention of permutations
  • Parallel algorithms
  • Scheduling
  • Work
  • Write-All

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Chlebus, B. S., Malewicz, G., Dobrev, S., Shvartsman, A., Kowalski, D. R., & Vrto, I. (2001). Towards practical deterministic Write-All algorithms. 271-280. Paper presented at 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001), Crete Island, Greece.