Flat combining and the synchronization-parallelism tradeoff

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2010, Pages 355-364

  Hendler, Danny ^a   Incze, Itai ^b   Shavit, Nir ^b   Tzafrir, Moran ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Concurrent data structures; Multiprocessors; Synchronization

Indexed keywords

CONCURRENT DATA-STRUCTURES; DATA STRUCTURE DESIGN; FINE GRAINED; LOCK-FREE; PRIORITY QUEUE ALGORITHMS;

ALGORITHMS; DATA STRUCTURES; MULTIPROCESSING SYSTEMS; QUEUEING THEORY;

SYNCHRONIZATION;

EID: 77954891944     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810479.1810540     Document Type: Conference Paper

References (26)

1. BERGER, E. D., McKINLEY, K. S., BLUMOFE, R. D., AND WILSON, P. R. Hoard: a scalable memory allocator for multithreaded applications. SIGPLAN Not. 35, 11 (2000), 117-128.
2. EASTEP, J., WINGATE, D., SANTAMBROGIO, M., AND AGARWAL, A. Smartlocks: Self-aware synchronization through lock acquisition scheduling. In 4th Workshop on Statistical and Machine learning approaches to ARchitecture and compilaTion (SMARTS?10) (2009).
3. FREDMAN, M. L., SEDGEWICK, R., SLEATOR, D. D., AND TARJAN, R. E. The pairing heap: A new form of self-adjusting heap. Algorithmica 1, 1 (1986), 111-129.
4. HANKE, S. The performance of concurrent red-black tree algorithms. Lecture Notes in Computer Science 1668 (1999), 286-300.
5. HENDLER, D., INCZE, I., SHAVIT, N., AND TZAFRIR, M. Scalable flat-combining based synchronous queues, 2010.
6. HENDLER, D., SHAVIT, N., AND YERUSHALMI, L. A scalable lock-free stack algorithm. In SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (New York, NY, USA, 2004), ACM, pp. 206-215.
7. HERLIHY, M., LEV, Y., AND SHAVIT, N. A lock-free concurrent skiplist with wait-free search, 2007.
8. HERLIHY, M., AND SHAVIT, N. The Art of Multiprocessor Programming. Morgan Kaufmann, NY, USA, 2008.
9. HERLIHY, M., AND WING, J. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12, 3 (July 1990), 463-492.
10. HOFFMAN, M., SHALEV, O., AND SHAVIT, N. The baskets queue. In OPODIS (2007), pp. 401-414.
11. HUNT, G. C., MICHAEL, M. M., PARTHASARATHY, S., AND SCOTT, M. L. An efficient algorithm for concurrent priority queue heaps. Inf. Process. Lett. 60, 3 (1996), 151-157.
12. KUNG, H., AND ROBINSON, J. On optimistic methods for concurrency control. ACM Transactions on Database Systems 6, 2 (1981), 213-226.
13. LAMPORT, L. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers C-28, 9 (September 1979), 690.
14. LEA, D. util.concurrent.ConcurrentHashMap in java.util.concurrent the Java Concurrency Package. http://gee.cs.oswego.edu/cgi-bin/viewcvs.cgi/jsr166/- src/main/java/util/concurrent/.
15. LOTAN, I., AND SHAVIT, N. Skiplist-based concurrent priority queues. In Proc. of the 14th International Parallel and Distributed Processing Symposium (IPDPS) (2000), pp. 263-268.
16. MELLOR-CRUMMEY, J., AND SCOTT, M. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems 9, 1 (1991), 21-65.
17. MICHAEL, M. M., AND SCOTT, M. L. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proc. 15th ACM Symp. on Principles of Distributed Computing (1996), pp. 267-275.
18. PETTIE, S. Towards a final analysis of pairing heaps. In Data Structures (Dagstuhl, Germany, 2006), L. Arge, R. Sedgewick, and D. Wagner, Eds., no. 06091 in Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fÄur Informatik (IBFI), Schloss Dagstuhl, Germany.
19. PUGH, W. Skip lists: a probabilistic alternative to balanced trees. ACM Transactions on Database Systems 33, 6 (1990), 668-676.
20. SCOTT, M. L., AND SCHERER, W. N. Scalable queue-based spin locks with timeout. ACM SIGPLAN Notices 36, 7 (2001), 44-52.
21. SHALEV, O., AND SHAVIT, N. Predictive log synchronization. In Proc. of the EuroSys 2006 Conference (2006), pp. 305-315.
22. SHAVIT, N., AND ZEMACH, A. Combining funnels: a dynamic approach to software combining. J. Parallel Distrib. Comput. 60, 11 (2000), 1355-1387.
23. TREIBER, R. K. Systems programming: Coping with parallelism. Tech. Rep. RJ 5118, IBM Almaden Research Center, April 1986.
24. TZAFRIR, M. C++ multi-platform memory-model solution with java orientation. http://groups.google.com/group/cpp-framework.
25. YEW, P.-C., TZENG, N.-F., AND LAWRIE, D. H. Distributing hot-spot addressing in large-scale multiprocessors. IEEE Trans. Comput. 36, 4 (1987), 388-395.
26. YONEZAWA, O. T., OYAMA, Y., TAURA, K., AND YONEZAWA, A. Executing parallel programs with synchronization bottlenecks efficiently. In in Proceedings of International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA '99). Sendai, Japan: World Scientific (1999), World Scientific, pp. 182-204.