Purchase this Article:
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated

Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael, Martin Vechev

Step 1

Sign in or create a free Web account
Sign in with your Web account



-or-
Create a free Web account

Step 2

Pricing and access depends on your membership or subscriptions with ACM.
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
ACM Member$10.00
ACM Student Member$5.00
Non Member$15.00

Join ACM and subscribe to the ACM Digital Library to gain access to all materials
Professional Membership
with an ACM Digital Library subscription
$198.00
Student Membership
with an ACM Digital Library subscription
$42.00

Join a sponsoring SIG and access this Article and all other materials they sponsor
SIGACT Membership $18.00
SIGACT Online Membership $18.00
Sigplan-Fortran Forum $20.00

Buy the publication that this Article appeared in
POPL'11: Principles of Programming Languages
Cover Image
ACM Member$46.00
Non Member$92.00
SIGPLAN Notices Volume: 46 Issue: 01
Cover Image
ACM Member$19.00
Non Member$38.00
Please sign in, (step 1), to place your order
 

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