Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
that any implementation of binary LL/SC from unary LL/SC will have to incur nonconstant over
 

Summary: that any implementation of binary LL/SC from
unary LL/SC will have to incur non­constant over­
head.
References
[1] J. Alemany and E. W. Felten. ``Performance Is­
sues in Non­blocking Synchronization on Shared­
memory Multiprocessors.'' Proceedings of the
11th ACM Symposium on Principles of Dis­
tributed Computing , pages 124--134, August
1992.
[2] R. J. Anderson and H. Woll. ``Wait­Free parallel
algorithms for the union­find problem.'' Proceed­
ings of the 23rd ACM Symposium on Theory of
Computation, pages 370--380, May 1991.
[3] R. Anderson, ``Primitives for Asynchronous List
Compression,'' Mathematical Systems Theory,
Vol. 27, 1994.
[4] H. Attiya, N. Lynch and N. Shavit, ``Are Wait­
Free Algorithms Fast?'' Journal of the ACM,
Vol. 41, No. 4 (July 1994), pp. 725­763.

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences