Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Waitfree TestandSet (Extended Abstract)

Summary: Wait­free Test­and­Set
(Extended Abstract)
Yehuda Afek 1;4 , Eli Gafni 2? , John Tromp 3 , and Paul M.B. Vitanyi 3;5
1 Computer Science Department, Tel­Aviv University, Ramat­Aviv 69978 Israel.
2 Department of Computer Science, University of California, Los Angeles CA 90024.
3 Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The
4 AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974.
5 Faculteit Wiskunde en Informatica, Universiteit van Amsterdam.
Abstract. This paper presents an economical, randomized, wait­free
construction of an n­process test­and­set bit from read write registers.
The test­and­set shared object has two atomic operations, test&set, which
atomically reads the bit and sets its value to 1, and the reset operation
that resets the bit to 0.
We identify two new complexity measures by which to evaluate wait­
free algorithms: (a) The amount of randomness used, and (b) `Parallel­
Time'---the maximum sequential depth of an execution (i.e. longest chain
of operations that must precede each other).
The previously best known algorithm for n­process test­and­set [Her91]
takes an


Source: Afek, Yehuda - School of Computer Science, Tel Aviv University


Collections: Computer Technologies and Information Sciences