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

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.

Towards practical deterministic Write-All algorithms. / Chlebus, B. S.; Malewicz, G.; Dobrev, S.; Shvartsman, A.; Kowalski, D. R.; Vrto, I.

2001. 271-280 Paper presented at 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001), Crete Island, Greece.

Research output: Contribution to conferencePaper

Chlebus, BS, Malewicz, G, Dobrev, S, Shvartsman, A, Kowalski, DR & Vrto, I 2001, 'Towards practical deterministic Write-All algorithms', Paper presented at 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001), Crete Island, Greece, 7/3/01 - 7/6/01 pp. 271-280.
Chlebus BS, Malewicz G, Dobrev S, Shvartsman A, Kowalski DR, Vrto I. Towards practical deterministic Write-All algorithms. 2001. Paper presented at 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001), Crete Island, Greece.
Chlebus, B. S. ; Malewicz, G. ; Dobrev, S. ; Shvartsman, A. ; Kowalski, D. R. ; Vrto, I. / Towards practical deterministic Write-All algorithms. Paper presented at 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001), Crete Island, Greece.10 p.
@conference{6901a6c934bc4256aa59414abdf2f13c,
title = "Towards practical deterministic Write-All algorithms",
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.",
keywords = "Contention of permutations, Parallel algorithms, Scheduling, Work, Write-All",
author = "Chlebus, {B. S.} and G. Malewicz and S. Dobrev and A. Shvartsman and Kowalski, {D. R.} and I. Vrto",
year = "2001",
month = "1",
day = "1",
language = "English (US)",
pages = "271--280",
note = "13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001) ; Conference date: 03-07-2001 Through 06-07-2001",

}

TY - CONF

T1 - Towards practical deterministic Write-All algorithms

AU - Chlebus, B. S.

AU - Malewicz, G.

AU - Dobrev, S.

AU - Shvartsman, A.

AU - Kowalski, D. R.

AU - Vrto, I.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

AB - 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.

KW - Contention of permutations

KW - Parallel algorithms

KW - Scheduling

KW - Work

KW - Write-All

UR - http://www.scopus.com/inward/record.url?scp=0034832393&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034832393&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0034832393

SP - 271

EP - 280

ER -