Atomic m-register operations

Michael Merritt, Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We investigate systems where it is possible to access several shared registers in one atomic step. Extending proofs in [Her91, LA87], we characterize those systems in which the consensus problem can be solved in the presence of faults and give bounds on the space required. We also describe a fast solution to the mutual exclusion problem using atomic m-register operations.

Original languageEnglish
Title of host publicationDistributed Algorithms - 5th International Workshop, WDAG 1991, Proceedings
EditorsPaul G. Spirakis, Lefteris Kirousis, Sam Toueg
PublisherSpringer Verlag
Pages289-294
Number of pages6
ISBN (Print)9783540552369
DOIs
StatePublished - 1992
Externally publishedYes
Event5th International Workshop on Distributed Algorithms, WDAG 1991 - Delphi, Greece
Duration: 7 Oct 19919 Oct 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume579 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Workshop on Distributed Algorithms, WDAG 1991
Country/TerritoryGreece
CityDelphi
Period7/10/919/10/91

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

Fingerprint

Dive into the research topics of 'Atomic m-register operations'. Together they form a unique fingerprint.

Cite this