Conditional memory ordering

Proceedings - International Symposium on Computer Architecture

Volumn 2006, Issue , 2006, Pages 41-52

  Von Praun, Christoph ^a   Cain, Harold W ^a   Choi, Jong Deok ^a   Ryu, Kyung Dong ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; COMPUTER SOFTWARE; JAVA PROGRAMMING LANGUAGE; MATHEMATICAL MODELS; SOFTWARE PROTOTYPING; SYNCHRONIZATION;

CONDITIONAL MEMORY ORDERING; MEMORY BARRIER INSTRUCTION; PROACTIVE MODELS; SOFTWARE SYNCHRONIZATION;

COMPUTER ARCHITECTURE;

EID: 33845879321     PISSN: 10636897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCA.2006.16     Document Type: Conference Paper

References (35)

1. S.V. Adve and M. D. Hill. Weak ordering - a new definition. In Proc. of the 17th Intl. Symp. on Computer Architecture, June 1990.
2. C. Amza, A. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel. Treadmarks: Shared memory computing on networks of workstations. IEEE Computer, 29(2): 18-28, Feb. 1996.
3. R. Arimilli, J. Dodson, D. Williams, and J. Lewis. Demand based sync bus operation. US Patent 6065086, May 2000.
4. R. Arimilli, J. Dodson, D. Williams, and J. Lewis. Demand based sync bus operation. US Patent 6175930, January 2001.
5. B. Bershad and M. Zekauskas. Midway: Shared memory parallel programming with entry consistency for distributed memory multiprocessors. Technical Report CMU-CS-91-170, Carnegie-Mellon University, Sept. 1991.
6. J. Choi, M. Gupta, M. Serrano, V. Sreedhar, and S. Midkiff. Escape analysis for Java. In Proc. Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA '99), pages 1-19. ACM Press, Nov. 1999.
7. K. Gharachorloo, A. Gupta, and J. Hennessy. Two techniques to enhance the performance of memory consistency models. In Proc. of the 1991 Intl. Conf. on Parallel Processing, pages 355-364, August 1991.
8. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proc. of the 17th Intl. Symposium on Computer Architecture, pages 15-26, 1990.
9. K. Gharachorloo, M. Sharma, S. Steely, and S. V. Doren. Architecture and design of AlphaServer GS 320. In Proc. of the Ninth Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, pages 13-24, November 2000.
10. C. Gniady, B. Falsafi, and T. N. Vijaykumar. Is SC + ILP = RC? In Proc. of the 26th Intl. Symp. on Computer Architecture, pages 162-171, May 1999.
11. N. Grcevski, A. Kielstra, K. Stoodley, M. G. Stoodley, and V. Sundaresan. Java just-in-time compiler and virtual machine improvements for server and middleware applications. In Proceedings of the 3rd Virtual Machine Research and Technology Symposium, pages 151-162, May 2004.
12. G. Guthrie, R. Arimilli, J. Dodson, and D. Williams. Multiprocessor speculation mechanism via a barrier speculation flag. US Patent 6691220, February 2002.
13. G. Guthrie, R. Arimilli, J. Dodson, and D. Williams. Multiprocessor speculation mechanism for efficiently managing multiple barrier operations. US Patent 6625660, September 2003.
14. G. Guthrie, R. Arimilli, J. Dodson, and D. Williams. Mechanism for folding storage barrier operations in a multiprocessor system. US Patent 6725340, April 2004.
15. Intel Corporation. IA-32 Intel architecture software developer's manual, volume 3: System programming guide. http://developer.intel.com/design/pentiumIV/ manuals, 2005.
16. JGF. Java Grande Forum multi-threaded benchmark suite, 1999.
17. K. Kawachiya, A. Koseki, and T. Onodera. Lock reservation: Java locks can mostly do without atomic operations. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA'02), pages 292-310, Nov. 2002.
18. T. O. K. Kawachiya and A. Koseki. Lock reservation for Java reconsidered. In Proceedings of the European Conference on Object-Oriented Programming (ECOOP'04), pages 560-584, June 2004.
19. P. Keleher, A. Cox, and W. Zwaenepoel. Lazy release consistency for software distributed shared memory. In Proceedings of the Annual International Symposium on Computer Architecture (ISCA'92), pages 13-21, May 1992.
20. A. Krishnamurthy and K. Yelick. Analyses and optimizations for shared address space programs. Journal of Parallel and Distributed Computing, 38(2): 130-144, Nov. 1996.
21. L. Lamport. Time, clock and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, July 1978.
22. L. Lamport. How to make a correct multiprocess program execute correctly on a multiprocessor. IEEE Trans. on Computers, 46(7):779-782, July 1997.
23. P. Mackerras, T. Matthews, and R. Swanberg. Operating system exploitation of the power5 system. IBM Journal of Research and Development, 49(4/5):533-541, 2005.
24. J. Manson, W. Pugh, and S. Adve. The Java memory model. In Proceedings of the Symposium on Principles of Programming Languages (POPL'05), pages 378-391, 2005.
25. M. M. K. Martin, D. J. Sorin, M. D. Hill, and D. A. Wood. Bandwidth adaptive snooping. In Proceedings of the Eighth International Symposium on High Performance Computer Architecture (HPCA-8), pages 251-262, 2002.
26. T. Ogasawara, H. Komatsu, and T. Nakatani. To-lock: Removing lock overhead using the owners' temporal locality. In Proceedings of the Conference on Parallel Architectures and Compilation Techniques (PACT'04), pages 255-266, Oct. 2004.
27. T. Onodera and K. Kawachiya. A study of locking with bimodal fields. In Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA'99), pages 223-237, Nov. 1999.
28. P. Ranganathan, V. S. Pai, and S. V. Adve. Using speculative retirement and larger instruction windows to narrow the performance gap between memory consistency models. In Proc. of the Ninth Symp. on Parallel algorithms and Architectures, pages 199-210, 1997.
29. R. Schwarz and F. Mattern. Detecting causal relationships in dirstibuted computations: In search of the holy grail. Journal of Distributed Computing, 7(3):149-174, 1994.
30. D. Shasha and M. Snir. Efficient and correct execution of parallel programs that share memory. ACM Trans. on Programming Languages and Systems, 10(2):282-312, Apr. 1988.
31. E. Silha, C. May, and B. Frey. PowerPC User Instruction Set Architecture (Book I), 2003.
32. E. Stolte, C. von Praun, G. Alonso, and T. Gross. Scientific data repositories - designing for a moving target. In Proceedings on the International Conference on Management of Data and Symposium on Principles of Database Systems (SIGMOD/PODS'03), pages 349-360, June 2003.
33. M. G. Stoodley and V. Sundaresan. Automatically reducing repetitive synchronization with a just-in-time compiler for Java. In Proceedings of the 3rd Annual Symposium on Code Generation and Optimization, pages 27-36, March 2005.
34. Z. Sura, X. Fang, C.-L. Wong, S. P. Midkiff, J. Lee, and D. Padua. Compiler techniques for high performance sequentially consistent Java programs. In Proceedings of the Symposium Principles and Practice of Parallel Programming (PPoPP'05), pages 2-13, June 2005.
35. C. von Praun. Deconstructing redundant memory synchronization. In Reader of the Workshop on Duplicating, Deconstructing, and Debunking (WDDD'05), June 2005.