Techniques for efficient placement of synchronization primitives

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2009, Pages 199-208

  Nicolau, Alexandru ^a   Li, Guangqiang ^a   Kejariwal, Arun ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b YAHOO INC   (United States)

Author keywords

Compilers; Multithreading; Parallelization; Performance

Indexed keywords

COMPILER TECHNIQUES; COMPILERS; CONCURRENT SOFTWARE; CONTROL FLOW GRAPHS; LINUX KERNEL; MULTITHREADING; OPEN-SOURCE CODE; PARALLELIZATION; PERFORMANCE; REAL CODE; SYNCHRONIZATION PRIMITIVE; THREAD-LEVEL PARALLELISM;

COMPUTER OPERATING SYSTEMS; MULTITASKING; PARALLEL PROGRAMMING; PROGRAM COMPILERS; SYNCHRONIZATION;

CONCURRENCY CONTROL;

EID: 67650096789     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1504176.1504207     Document Type: Conference Paper

References (49)

1. S. Midkiff and D. Padua. Compiler algorithms for synchronization. IEEE Transactions on Computers, C-36(12):1485-1495, December 1987. (Pubitemid 18537646)
2. J. R. Goodman, M. K. Vernon, and P. J. Woest. Efficient synchronization primitives for large-scale cache-coherent multiprocessors. In Proceedings of the Third International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-III), pages 64-75, Boston, MA, 1989.
3. J. Labarta and E. Ayguad́e. GTS: Extracting full parallelism out of DO loops. In Proceedings of the Parallel Architectures and Languages Europe, pages 43-54, Eindhoven, The Netherlands, 1989.
4. G. Granunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23(6):60-69, 1990. (Pubitemid 20737722)
5. Z. Li. Compiler algorithms for event variable synchronization. In Proceedings of the 1991 ACM International Conference on Supercomputing, Cologne, Germany, June 1991.
6. A. Krishnamurthy and K. Yelick. Optimizing parallel programs with explicit synchronization. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation, pages 196-204, La Jolla, CA, 1995.
7. A. Aiken and D. Gay. Barrier inference. In Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 342-354, San Diego, CA, 1998.
8. A. Kagi. Mechanism for Efficient Shared-Memory Lock-based Synchronization. PhD thesis, Department of Computer Science, University ofWisconsin-Madison, 1999.
9. D. S. Nikolopoulos and T. S. Papatheodorou. Fast synchronization on scalable cache-coherent multiprocessors using hybrid primitives. In Proceedings of the 14th International Parallel and Distributed Processing Symposium, pages 711- 720, Cancun, Mexico, 2000.
10. D. F. Bacon, R. Konuru, C. Murthy, and M. J. Serrano. Thin locks: Featherweight synchronization for java. ACM SIGPLAN Notices, 39(4):583-595, 2004.
11. A. Kejariwal, X. Tian, H. Saito, W. Li, M. Girkar, U. Banerjee, A. Nicolau, and C. D. Polychronopoulos. Lightweight lock-free synchronization methods for multithreading. In Proceedings of the 20th ACM International Conference on Supercomputing, pages 361-371, Cairns, Australia, 2006. (Pubitemid 47168523)
12. The Linux Kernel Archives. http://www.kernel.org.
13. J. A. Fisher. Trace Scheduling: A technique for global microcode compaction. IEEE Transacions on Computers, C-30(7):478-490, July 1981. (Pubitemid 11522259)
14. A. Nicolau. Percolation scheduling : A parallel compilation technique. Technical Report TR85-678, Dept. of Computer Science, Cornell University, May 1985.
15. W. M. W. Hwu, S. A. Mahlke, W. Y. Chen, P. P. Chang, N. J. Warter, R. A. Bringmann, R. G. Ouellette, R. E. Hank, T. Kiyohara, G. E. Haab, J. G. Holm, and D. M. Lavery. The superblock: An effective technique for VLIW and superscalar compilation. The JournaL of Supercomputing, 7(1-2):229-248, November 1993. (Pubitemid 23689572)
16. Jens Knoop, Oliver Rüthing, and Bernhard Steffen. Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems, 16(4):1117-1155, July 1994.
17. M. Hailperin. Cost-optimal code motion. ACM Transactions on Programming Languages and Systems, 20(6):1297-1322, 1998.
18. E. Morel and C. Renvoise. Global optimization by suppression of partial redundancies. Communications of the ACM, 22(2):96-103, February 1979. (Pubitemid 9443113)
19. SPEC CPU Benchmarks. http://www.spec.org/benchmarks.html.
20. A. Kejariwal, X. Tian, W. Li, M. Girkar, S. Kozhukhov, H. Saito, U. Banerjee, A. Nicolau, A. V. Veidenbaum, and C. D. Polychronopoulos. On the performance potential of different types of speculative thread-level parallelism. In Proceedings of the 20th ACM International Conference on Supercomputing, pages 24-35, Cairns, Australia, 2006.
21. U. Banerjee. Dependence Analysis. Kluwer Academic Publishers, Boston, MA, 1997.
22. SPEC CPU2006. http://www.spec.org/cpu2006.
23. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.
24. K. Karplus and A. Nicolau. Efficient hardware for multiway jumps and prefetches. In Proceedings of the 18th annual workshop on Microprogramming, pages 11-18, 1985. (Pubitemid 16577914)
25. D. Kuck. The Structure of Computers and Computations, VOLUME 1. John Wiley and Sons, New York, NY, 1978.
26. SPEC CINT2006. http://www.spec.org/cpu2006/CINT2006.
27. S. Novack and A. Nicolau. Trailblazing: A hierarchical approach to percolation scheduling. International Journal of Parallel Programming, 23(1), 1995.
28. A. Nicolau. Percolation scheduling. In Proceedings of the 1985 International Conference on Parallel Processing, August 1985.
29. K. Ebciǒglu and T. Nakatani. A new compilation technique for parallelizing loops with unpredictable branches on a VLIW architecture. In Proceedings of the Third Workshop on Languages and Compilers for Parallel Computing, Urbana, IL, May 1990.
30. S. Muchnick. Advanced Compiler Design Implementation. Second edition, 2000.
31. SPEC CPU2000. http://www.spec.org/cpu2000.
32. Sendmail. http://www.sendmail.org/.
33. Apache. http://download.nextag.com/apache.
34. D. A. Padua. Multiprocessors: Discussion of theoritical and practical problems. Technical Report 79-990, Department of Computer Science, University of Illinois at Urbana-Champaign, November 1979.
35. J. Davies. Parallel loop constructs for multiprocessors. Technical Report 81-1070, Department of Computer Science, University of Illinois at Urbana- Champaign, May 1981.
36. C. Zhu and P. Yew. A synchronization scheme and its applications for large scale multiprocessors. In Proceedings of the Conference on Distributed Computing Systems, pages 486-491, San Francisco, CA, May 1984.
37. J. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21-65, 1991.
38. D. M. Tullsen, J. L. Lo, S. J. Eggers, and H. M. Levy. Supporting fine-grained synchronization on a simultaneous multithreading processor. In Proceedings of the Fifth International Symposium on High-Performance Computer Architecture, pages 54-58, 1999.
39. S. Sridharan, A. Rodrigues, and P. Kogge. Evaluating synchronization techniques for light-weight multithreaded/multicore architectures. In Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 57-58, San Diego, CA, 2007.
40. W. Zhu, V. C Sreedhar, Z. Hu, and G. R. Gao. Synchronization state buffer: supporting efficient fine-grain synchronization on many-core architectures. In Proceedings of the 34th International Symposium on Computer Architecture, pages 35-45, San Diego, CA, 2007. (Pubitemid 47582089)
41. J. Whaley and M. Rinard. Compositional pointer and escape analysis for Java programs. In Proceedings of the 14th ACM SIGPLAN Conference on Object Oriented Programming, Systems, Languages, and Applications, pages 187-206, Denver, CO, 1999. (Pubitemid 32213984)
42. A. Sǎlcianu and M. Rinard. Pointer and escape analysis for multithreaded programs. In Proceedings of the 11th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 12-23, Snowbird, UT, 2001. (Pubitemid 33720374)
43. R. Cytron. Doacross: Beyond vectorization for multiprocessors. In Proceedings of the 1986 International Conference on Parallel Processing, pages 836-844, St. Charles, IL, August 1986. (Pubitemid 17486499)
44. S. Midkiff and D. Padua. Compiler generated synchronization for DO loops. In Proceedings of the 1986 International Conference on Parallel Processing, pages 544-551, St. Charles, IL, August 1986. (Pubitemid 17486449)
45. H. Kasahara, H. Honda, M. Iwata, and M. Hirota. A compilation scheme for macro-dataow computation on hierarchical multiprocessor systems. In Proceedings of the International Conference on Parallel Processing, pages II294-II295, Urbana-Champaign, IL, August 1990.
46. M. B. Girkar. Functional Parallelism Theoretical Foundations and Implementation. PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, December 1991.
47. R. Cytron, M. Hind, andW. Hsieh. Automatic generation of DAG parallelism. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pages 54-68, Portland, OR, 1989.
48. V. Sarkar. Instruction reordering for fork-join parallelism. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, pages 322-336, White Plains, NY, 1990.
49. C. Tian, V. Nagarajan, R. Gupta, and S. Tallam. Dynamic recognition of synchronization operations for improved data race detection. In Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, pages 143-154, Seattle, WA, 2008.