Optimized lock assignment and allocation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimized lock assignment and allocation: a method for exploiting concurrency among critical sections

Full text

Pdf (72 KB)

Source

Principles and Practice of Parallel Programming archive
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming table of contents

San Jose, California, USA

POSTER SESSION: Posters table of contents

Pages: 146 - 147

Year of Publication: 2007

ISBN:978-1-59593-602-8

Authors

Yuan Zhang	University of Delaware, Newark, DE
Vugranam C. Sreedhar	IBM TJ Watson Research Center, Hawthorne, NY
Weirong Zhu	University of Delaware, Newark, DE
Vivek Sarkar	IBM TJ Watson Research Center, Yorktown Heights, NY
Guang R. Gao	University of Delaware, Newark, DE

Sponsors

ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 75, 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/1229428.1229459 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	Jim Graph and Andreas Reuter, "Transaction Processing: Concepts and Techniques", Morgan Kaufmann, 1993.
	2	Yuan Zhang and Vugranam C. Sreedhar and Weirong Zhu and Vivek Sarkar and Guang R. Gao, "Optimized Lock Assignment and Allocation for Productivity: A Method for Exploiting Concurrency among Critical Sections", CAPSL-TM-065, University of Delaware, Newark, DE, April, 2006.