Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Quantitative relaxation of concurrent data structures
Henzinger T., Kirsch C., Payer H., Sezgin A., Sokolova A.  POPL 2013 (Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Rome, Italy, Jan 23-25, 2013)317-328.2013.Type:Proceedings
Date Reviewed: May 2 2013

Evolving trends in hardware, especially the shift from single-core to multicore and many-core processors, have pushed current programming to the center of the discussion in many designs and implementations. Many reports published in recent years address the parallelization of single-threaded programs for multicore and many-core architectures.

This paper tackles the problem from an entirely different angle. To reduce contention and thus improve scalable performance in multithreaded programming, the authors propose quantitative relaxation of concurrent data structures. They present examples of k-stack and k-stuttering counters that illustrate the implementation of relaxed data structures, accompanied by illuminating discussions.

The significance of this paper is that it provides a framework for quantitative relaxation of concurrent data structures, and thus opens a new path for exploring concurrency in single-threaded designs.

Reviewer:  Weijia Che Review #: CR141198 (1308-0720)
Bookmark and Share
 
Lists, Stacks, And Queues (E.1 ... )
 
 
Semantics (D.3.1 ... )
 
 
Concurrent Programming (D.1.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Lists, Stacks, And Queues": Date
A priority queue for the all pairs shortest path problem
Moffat A., Takaoka T. Information Processing Letters 18(4): 189-193, 1984. Type: Article
Mar 1 1985
Amortized efficiency of list update and paging rules
Sleator D., Tarjan R. (ed) Communications of the ACM 28(2): 202-208, 1985. Type: Article
Nov 1 1985
Self-organizing search lists using probabilistic back-pointers
Hester J., Hirschberg D. Communications of the ACM 30(12): 1074-1079, 1987. Type: Article
Oct 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy