Book review of synchronization algorithms and concurrent programming by Gadi Taubenfeld (Pearson/Prentice Hall, 2006)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Book review of synchronization algorithms and concurrent programming by Gadi Taubenfeld (Pearson/Prentice Hall, 2006)

Full text

Pdf (728 KB)

Source

ACM SIGACT News archive
Volume 40 , Issue 1 (March 2009) table of contents

COLUMN: Technical columns table of contents

Pages 47-50

Year of Publication: 2009

ISSN:0163-5700

Reviewer

Danny Hendler

Ben-Gurion University

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 17, Downloads (12 Months): 49, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1515698.1515711 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	T. E. Anderson, The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, v.1 n.1, p.6-16, January 1990 [doi>10.1109/71.80120]
	2	Hagit Attiya , Jennifer Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, John Wiley & Sons, 2004
	3	Y. Bar-David and G. Taubenfeld. Automatic discovery of mutual exclusion algorithms. In Proc. 17th International Symp. on Distributed Computing, LNCS 2648, Springer-Verlag, 2003, 136--150.
	4	James E. Burns , Nancy A. Lynch, Bounds on shared memory for mutual exclusion, Information and Computation, v.107 n.2, p.171-184, Dec. 1993 [doi>10.1006/inco.1993.1065]
	5	Michael J. Fischer , Nancy A. Lynch , James E. Burns , Allan Borodin, Distributed FIFO allocation of identical resources using small shared space, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.1, p.90-114, Jan. 1989 [doi>10.1145/59287.59292]
	6	Michael J. Fischer , Nancy A. Lynch , Michael S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM (JACM), v.32 n.2, p.374-382, April 1985 [doi>10.1145/3149.214121]
	7	Michael J. Fischer , Shlomo Moran , Steven Rudich , Gadi Taubenfeld, The Wakeup Problem, SIAM Journal on Computing, v.25 n.6, p.1332-1357, Dec. 1996 [doi>10.1137/S0097539793254959]
	8	Michael J. Fischer , Shlomo Moran , Gadi Taubenfeld, Space-efficient asynchronous consensus without shared memory initialization, Information Processing Letters, v.45 n.2, p.101-105, Feb. 26, 1993 [doi>10.1016/0020-0190(93)90223-V]
	9	Gary Granunke , Shreekant Thakkar, Synchronization Algorithms for Shared-Memory Multiprocessors, Computer, v.23 n.6, p.60-69, June 1990 [doi>10.1109/2.55501]
	10	Jim Gray, Notes on Data Base Operating Systems, Operating Systems, An Advanced Course, p.393-481, January 1978
	11	Debra Hensgen , Raphael Finkel , Udi Manber, Two algorithms for barrier synchronization, International Journal of Parallel Programming, v.17 n.1, p.1-17, Feb. 1988 [doi>10.1007/BF01379320]
	12	Maurice Herlihy, Wait-free synchronization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.1, p.124-149, Jan. 1991 [doi>10.1145/114005.102808]
	13	M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufman, 2008.
	14	J. L. W. Kessels. Arbitration without common modifiable variables. Acta Informatica, 17(2):135--141, 1982.
	15	Leslie Lamport, A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, v.17 n.8, p.453-455, Aug. 1974 [doi>10.1145/361082.361093]
	16	Leslie Lamport, A fast mutual exclusion algorithm, ACM Transactions on Computer Systems (TOCS), v.5 n.1, p.1-11, Feb. 1987 [doi>10.1145/7351.7352]
	17	M. C. Loui and H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163--183, 1987.
	18	Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1996
	19	John M. Mellor-Crummey , Michael L. Scott, Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Transactions on Computer Systems (TOCS), v.9 n.1, p.21-65, Feb. 1991 [doi>10.1145/103727.103729]
	20	Maged M. Michael , Michael L. Scott, Simple, fast, and practical non-blocking and blocking concurrent queue algorithms, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.267-275, May 23-26, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/248052.248106]
	21	G. L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115--116, 1981.
	22	G. L. Peterson. Observations on l-exclusion. In Proc. 28th Annual Allerton Conference on Communication, Control and Computing, pages 568--577, October 1990.
	23	Abraham Silberschatz , Peter Baer Galvin , Greg Gagne, Operating System Concepts, John Wiley & Sons, 2004
	24	Andrew S. Tanenbaum, Modern Operating Systems, Prentice Hall Press, Upper Saddle River, NJ, 2007
	25	G. Taubenfeld. The black-white bakery algorithm. In Proc. 18th International Symp. on Distributed Computing, LNCS 3274, Springer-Verlag, 2004, 56--70.

INDEX TERMS

Primary Classification:
A. General Literature
A.0 GENERAL

Collaborative Colleagues:

Danny Hendler: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player