Efficient multi-word locking using randomization

doi:10.1145/1073814.1073862

Efficient multi-word locking using randomization

Full Text:

Pdf

Buy this Article

Authors:	Phuong Hoai Ha	Chalmers University of Technology, Sweden
	Philippas Tsigas	Chalmers University of Technology, Sweden
	Mirjam Wattenhofer	ETH Zurich, Zurich, Switzerland
	Rogert Wattenhofer	ETH Zurich, Zurich, Switzerland

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 10 · Citation Count: 4

Published in:

	· Proceeding
	PODC '05 Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
	ACM New York, NY, USA ©2005 table of contents ISBN:1-58113-994-2 doi>10.1145/1073814.1073862

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- PODC '12

Tags: algorithms combinatorial algorithms computations on discrete structures concurrent programming dining philosophers experimentation graph algorithms multi-word locking multiprocessing/multiprogramming/multitasking performance randomization shared memory theory

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player