A key-based adaptive transactional memory executor

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Bai, Tongxin ^a   Shen, Xipeng ^b   Zhang, Chengliang ^a   Scherer III, William N ^c   Ding, Chen ^a   Scott, Michael L ^a  

^a University of Rochester

^b Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary

^c RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; CONCURRENT ENGINEERING; DATA STRUCTURES; PROBABILITY DISTRIBUTIONS; PROGRAM PROCESSORS; SCHEDULING ALGORITHMS;

ADAPTIVE PARTITIONING; HASHTABLES; SOFTWARE TRANSACTIONAL MEMORY SYSTEMS;

PARALLEL PROGRAMMING;

EID: 34548742772     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370498     Document Type: Conference Paper

References (23)

1. R. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann Publishers, October 2001.
2. A. J. Bernstein. Analysis of programs for parallel processing. IEEE Transactions on Electronic Computers, 15(5):757-763, Oct. 1966.
3. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. In Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Santa Barbara, CA, 1995.
4. T. M. Chilimbi and M. Hirzel. Dynamic hot data stream prefetching for general-purpose programs. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Berlin, Germany, June 2002.
5. R. Das, M. Uysal, J. Saltz, and Y.-S. Hwang. Communication optimizations for irregular scientific computations on distributed memory architectures. Journal of Parallel and Distributed Computing, 22(3):462-479, Sept. 1994.
6. C. Ding and K. Kennedy. Improving cache performance in dynamic applications through data and computation reorganization at run time. In Proceedings of the SIGPLAN '99 Conference on Programming Language Design and Implementation, Atlanta, GA, May 1999.
7. H. Han and C. W. Tseng. A comparison of locality transformations for irregular codes. In Lecture notes in computer science 1915 (Proceedings of LCR'2000), pages 70-84, Rochester, NY, 2000. Springer-Verlag.
8. M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer III. Software transactional memory for dynamic-sized data structures. In Proceedings of the 22th PODC, pages 92-101, Boston, MA, Jul. 2003.
9. M. Herlihy and J. E. Moss. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the 20th ISCA, pages 289-300, San Diego, CA, May 1993.
10. P. J. Janus and E. A. Lamagna. An adaptive method for unknown distributions in distributive partitioned sorting. IEEE Transactions on Computers, c-34(4):367-372, April 1985.
11. D. Lea. Concurrency jsr-166 interest site. http://gee.cs.oswego.edu/dl/ concurrency-interest/.
12. E. P. Markatos and T. J. LeBlanc. Using processor affinity in loop scheduling on shared-memory multiprocessors. IEEE Transactions on Parallel Distributed Systems, 5(4):379-400, 1994.
13. J. Mellor-Crummey, D. Whalley, and K. Kennedy. Improving memory hierarchy performance for irregular applications. International Journal of Parallel Programming, 29(3), June 2001.
14. M. M. Michael and M. L. Scott. An efficient algorithm for concurrent priority queue heaps. In Proceedings of the PODC, pages 267-275, 1996.
15. N. Mitchell, L. Carter, and J. Ferrante. Localizing nonaffine array references. In Proceedings of International Conference on Parallel Architectures and Compilation Techniques, Newport Beach, California, October 1999.
16. J. Philbin, J. Edler, O. J. Anshus, C. C. Douglas, and K. Li. Thread scheduling for cache locality. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems, 1996.
17. V. S. Pingali, S. A. McKee, W. C. Hsieh, and J. B. Carter. Computation Regrouping: Restructuring Programs for Temporal Data Cache Locality. In International Conference on Supercomputing, New York, NY, June 2002. best student paper.
18. W. N. Scherer III and M. L. Scott. Advanced contention management for dynamic software transactional memory. In Proceedings of the 24th PODC, Las Vegas, NV, Jul. 2005.
19. X. Shen and C. Ding. Adaptive data partition for sorting using probability distribution. In Proceedings of International Conference on Parallel Processing, Montreal, Canada, August 2004.
20. M. M. Strout, L. Carter, and J. Ferrante. Compiletime composition of run-time data and iteration reorderings. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, San Diego, CA, June 2003.
21. M. M. Strout and P. Hovland. Metrics and models for reordering transformations. In Proceedings of the 2nd ACM SIGPLAN Workshop on Memory System Performance, Washington DC, June 2004.
22. Y. Wu. Efficient discovery of regular stride patterns in irregular programs. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Berlin, Germany, June 2002.
23. Y. Yan, X. Zhang, and Z. Zhang. Cacheminer: A runtime approach to exploit cache locality on smp. IEEE Transactions on Parallel Distributed Systems, 11(4):357-374, 2000.