SIGN IN
SIGN UP
Reordering constraints for pthread-style locks
Full Text:
Pdf
Buy this Article
Author:
Hans-J. Boehm
HP Laboratories, Palo Alto, CA
Published in:
· Proceeding
PPoPP '07
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Pages 173 - 182
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-602-8
doi>
10.1145/1229428.1229470
2007 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 46
· Downloads (cumulative): 661
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PPoPP '14
Share:
|
Tags:
code reordering
concurrent programming structures
data race
languages
locks
memory barriers
memory fences
optimization
optimization
performance
pthreads
threads
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder