Lightweight lock-free synchronization methods for multithreading

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2006, Pages 361-371

  Kejariwal, Arun ^a   Saito, Hideki ^b   Tian, Xinmin ^b   Girkar, Milind ^b   Li, Wel ^b   Banerjee, Utpal ^b   Nicolau, Alexandru ^a   Polychronopoulos, Constantine D ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTEL CORPORATION   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEM RECOVERY; MICROPROCESSOR CHIPS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; SOFTWARE ENGINEERING;

MULTITHREADED SYSTEMS; SYNCHRONIZATION METHODS; TIME CONSUMING PROCESS;

MULTITASKING;

EID: 34547489493     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183401.1183452     Document Type: Conference Paper

References (43)

1. S. Midkiff and D. Padua, Compiler algorithms for synchronization. IEEE Transactions on Computers, 0-36(12)11485-1495, December 1987.
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. G. Granunke and S. Thakkar, Synchronization algorithms for shared-memory multiprocessors, IEEE Computer, 23(6):60-69, 1990.
4. Z. Li. Compiler algorithms for event variable synchronization, In Proceedings of the 1991 ACM International Conference on Supercomputing, Cologne, Germany, June 1991.
5. 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, OA, 1995.
6. A. Kagi, Mechanism for Efficient Shared-Memory Lock-based Synchronization, PhD thesis, Department of Computer Science, University of Wisconsin-Madison, 1999.
7. D. S. Nikolopoulos and T. S. Papatheodorou, Fast synchronization on scalable cache-coherent multiprocessors using hybrid primitives, In Proceedings of the 14-th International Parallel and Distributed Processing Symposium, pages 711-720, Cancun, Mexico, 2000.
8. J. Martinez and J, Torrellas, Speculative synchronization: Programmability and performance for parallel codes, IEEE Micro, 23(6):126-134, December 2003.
9. 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.
10. A. Aiken and D. Gay, Barrier inference, In Proceedings of the 85th. ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 342-354, San Diego, CA, 1998.
11. L. Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE 'transactions on Computers, C-28(9):690-691, 1979.
12. M. D. Hill, Multiprocessors should support simple memory-consistency models, IEEE Computer, 31(8):28-34, 1998.
13. S. Midkiff and D. Padua, Issues in the optimization of parallel programs, In Proceedings of the 1990 International Conference on Parallel Processing, pages 105-113, 1986.
14. V. Sarkar and B. Simons, Parallel program graphs and their classification, In Proceedings of the Sixth Workshop on Languages and Compilers for Parallel Computing, Portland, OR, August 1993.
15. SPEC OMP, http://ww.8pec.org/omp.
16. D. Kuck, The Structure of Computers and Computations, VOLUME 1, John Wiley and Sons, New York, NY, 1978.
17. R. Cytron, Doacross: Beyond vectorization for multiprocessors, In Proceedings of the 1986 International Conference on Parallel Processing, St. Charles, IL, August 1986.
18. T. H. Oormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990. [19] M. Girkar and C. D. Polychronopoulos, The hierarchical task graph as a univeral intermediate representation, International Journal of Parallel Programming, 22(5):519-551, 1994.
19. A. Silberschatz, P. B. Galvin, and G. Gagne, Operating System Concepts, John Wiley and Sons, 6 edition, 2001.
20. S. Owicki and L. Lamport, Proving liveness properties of concurrent programs, ACM Transactions on Programming Languages and Systems, 4(3):455-495, 1982.
21. Y.-S. Kwong, On Reductions and Livelocks in Asynchronous Parallel Computation, UMI Research Press, 1982.
22. J. Zahorjan, E. D. Lazowska, and D. L. Eager, Spinning versus blocking in parallel systems with uncertainty, In Proceedings of the International Seminar on Performance of Distributed and Parallel Systems, pages 455-472, December 1988.
23. A. R. Karlin, K. Li, M. S. Manasse, and S. Owicki, Empirical studies of competitve spinning for a shared-memory multiprocessor, In Proceedings of the Thirteenth ACM symposium on Operating systems principles, pages 41-55, Pacific Grove, CA, 1991.
24. L. Boguslavsky, K, Harzallah, A. Kreinen, K. Sevcik, and A. Vainshtein, Optimal strategies for spinning and blocking, Journal of Parallel and Distributed Computing, 21(2):246-254, 1994.
25. IA-32 Intel Architecture Software Developer's Manual, Volume 2B: Instruction Set Reference. ftp://download.intel.com/design/Pentlum4/raanuals/ 25366717.pdf.
26. AP-949 using spin-loops on Intel Pentium 4 and Intel Xeon processor, version 2.1. http://cache~tfWtf.lntel.eom/cd/00/00/01/76/17689.w.splnlock.pdf.
27. R. H. B. Netzer and B. P. Miller, What are race conditions? : Some issues and formalizations, ACM Letters on Programming Languages and Systems, l(1):74-88, 1992.
28. C. Flanagan and S. Qadeer, Types for atomicity, In Proceedings of the UÕ0S ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, pages 1-12, New Orleans, LA, 2003.
29. L. Wang and S. D. Stoller, Static analysis of atomicity for programs with non-blocking synchronization, In Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming, pages 61-71, Chicago, IL, 2005.
30. IA-32 Intel Architecture Software Developer's Manual, Volume 3: System Programming Guide. ftp://download.Intel.com/deslgn/Pentium4/manuals/25366S17. pdf.
31. M. Herlihy, A methodology for implementing highly concurrent data strucutres, In Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 197-206, Seattle, WA, 1990.
32. S. V. Adve and M. D. Hill, Weak ordering - a new definition, In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 2-14, Seattle, WA, 1990.
33. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy, Memory consistency and event ordering in scalable shared-memory multiprocessors, In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 15-26, Seattle, WA, 1990.
34. J. R. Goodman, Cache consistency and sequential consistency, Technical Report TR91-1006, Department of Computer Science, University of Illinois at Urbana-Champaign, February 1991, [36] OpenMP Specification, version 2.5. http://www.openmp.org/drupal/mp-documente/spec26.pdf.
35. X. Tian, M. Girkar, A. Bik, and H. Saito, Practical compiler techniques on efficient multithreaded code generation for OpenMP programs, The Computer Journal, 2005.
36. How to avoid false sharing. http://www.Intel.com/cd/lds/developer/asmo- na/eng/43813.htm.
37. Intel®VTune™Performance Analyzer 8, 0 for Linux, http: //www.intel.com/cd/software/products/asmo~na/eng/vtiine/vlln/lndax.litra, [40] D.-K. Chen, H.-M. Su, and P.-C. Yew, The impact of synchronization and granularity on parallel systems, In Proceedings of the 17th International Symposium on Computer Architecture, pages 239-248, Seattle, WA, 1990.
38. D. Shasha and M. Snir, Efficient and correct execution of parallel programs that share memory, ACM Transactions on Programming Languages and Systems, 10(2):282-312, 1988.
39. A. Kamil and K. Yelick, Concurrency ananlysis for parallel programs with txtually aligned barriers, In Proceedings of the 18th International Workshop on Languages and Compilers for Parallel Computing, Hawthorne, NY, October 2005.
40. J. Lee and D. A. Padua, Hiding relaxed memory consistency with a compiler, IEEE Transactions on Computers, 50(8):824-833, August 2001.
41. X. Fang, J. Lee, and S. P. Midkiff, Automatic fence insertion for shared memory multiprocessing, In Proceedings of the 17th Annual International Conference on Supercomputing, pages 285-294, San Francisco, CA, 2003.
42. B. J. Smith, Architecture and applications of the HEP multiprocessor computer system, In Proceedings of SPIE - Real-Time Signal Processing IV, pages 241-248, 1981.
43. S. L. Scott, Synchronization and communication in the T3E multiprocessor, In Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VII), pages 26-36, Cambridge, MA, October 1996.