Towards practical deterministic Write-All algorithms

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

Towards practical deterministic Write-All algorithms

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

Research output: Contribution to conference › Paper › peer-review

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 language	English (US)
Pages	271-280
Number of pages	10
State	Published - 2001
Externally published	Yes
Event	13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001) - Crete Island, Greece Duration: Jul 3 2001 → Jul 6 2001

Conference

Conference	13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001)
Country/Territory	Greece
City	Crete Island
Period	7/3/01 → 7/6/01

Keywords

Contention of permutations
Parallel algorithms
Scheduling
Work
Write-All

ASJC Scopus subject areas

Software
Safety, Risk, Reliability and Quality

Cite this

@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",

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

Y1 - 2001

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

T2 - 13th Annual Symposium on Parallel Algorithms and Architectures (SPAA 2001)

Y2 - 3 July 2001 through 6 July 2001

ER -

Towards practical deterministic Write-All algorithms

Abstract

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Cite this