Min-cut program decomposition for thread-level speculation

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 1, Issue , 2004, Pages 59-70

  Johnson, Troy A ^a   Eigenmann, Rudolf ^a   Vijaykumar, T N ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Chip Multiprocessor; Min Cut; Partitioning; Program Decomposition; Thread Level Speculation

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; MICROPROCESSOR CHIPS; MULTIPROCESSING PROGRAMS; PROGRAM COMPILERS; SCHEDULING;

MIN-CUT; PARTITIONING; PROGRAM DECOMPOSITION; SINGLE-CHIP MULTIPROCESSORS; THREAD-LEVEL SPECULATION;

COMPUTER PROGRAMMING;

EID: 8344246227     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/996841.996851     Document Type: Conference Paper

References (36)

1. A. Bhowmik and M. Franklin. A General Compiler Framework for Speculative Multithreading. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures, August 2002.
2. S. E. Breach, T. N. Vijaykumar, and G. S. Sohi. The Anatomy of the Register File in a Multiscalar Processor. In Proceedings of the 27th International Symposium on Microarchitecture, pages 181-190, November 1994.
3. M. Cintra, J. F. Martínez, and J. Torrellas. Architectural Support for Scalable Speculative Parallelization in Shared-Memory Multiprocessors. In Proceedings of the 27th International Symposium on Computer Architecture, pages 13-24, June 2000.
4. L. Codrescu and D. S. Wills. On Dynamic Speculative Thread Partitioning and the MEM-Slicing Algorithm. Journal of Universal Computer Science, 6(10):908-914, 2000.
5. J. Edmonds and R. M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of the ACM, 19:248-264, 1972.
6. L. R. Ford Jr. and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
7. M. Franklin and G. S. Sohi. ARB: A Hardware Mechanism for Dynamic Reordering of Memory References. IEEE Transactions on Computers, pages 552-571, May 1996.
8. M. J. Garzarán et al. Tradeoffs in Buffering Memory State for Thread-Level Speculation in Multiprocessors. In Proceedings of the 9th IEEE Symposium on High-Performance Computer Architecture, February 2003.
9. S. Gopal, T. N. Vijaykumar, J. E. Smith, and G. S. Sohi. Speculative Versioning Cache. In Proceedings of the 4th IEEE Symposium on High-Performance Computer Architecture, pages 195-205, February 1998.
10. L. Hammond, B. A. Nayfeh, and K. Olukotun. A Single-Chip Multiprocessor. IEEE Computer, 30(9):79-85, 1997.
11. L. Hammond, M. Willey, and K. Olukotun. Data Speculation Support for a Chip Multiprocessor. In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 58-69, October 1998.
12. J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach, 3rd Edition. Morgan Kaufmann, New York, 2002.
13. IBM. IBM e-Server Power4 System Microarchitecture. Technical report, October 2001.
14. I. H. Kazi and D. J. Lilja. JavaSpMT: A Speculative Thread Pipelining Parallelization Model for Java Programs. In Proceedings of the 14th International Parallel and Distributed Processing Symposium, pages 559-564, May 2000.
15. S. W. Kim and R. Eigenmann. The Structure of a Compiler for Explicit and Implicit Parallelism. In Proceedings of the Workshop on Languages and Compilers for Parallel Computing (LCPC), August 2001.
16. S. W. Kim et al. Reference Idempotency Analysis: A Framework for Optimizing Speculative Execution. In Proceedings of the Symposium on Principles and Practice of Parallel Programming, volume 36, pages 2-11, 2001.
17. V. Krishnan and J. Torrellas. Hardware and Software Support for Speculative Execution of Sequential Binaries on a Chip-Multiprocessor. In Proceedings of the International Conference on Supercomputing, pages 85-92, July 1998.
18. Y.-K. Kwok and I. Ahmad. Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors. ACM Computing Surveys, 31(4):406-471, 1999.
19. A. Moshovos, S. E. Breach, T. N. Vijaykumar, and G. S. Sohi. Dynamic Speculation and Synchronization of Data Dependences. In Proceedings of the 24th International Symposium on Computer Architecture, pages 181-193, June 1997.
20. K. Olukotun, L. Hammond, and M. Willey. Improving the Performance of Speculatively Parallel Applications on the Hydra CMP. In Proceedings of the International Conference on Supercomputing, pages 21-30, June 1999.
21. C. L. Ooi et al. Multiplex: Unifying Conventional and Speculative Thread-Level Parallelism on a Chip Multiprocessor. In Proceedings of the International Conference on Supercomputing, June 2001.
22. P. M. Petersen and D. A. Padua. Static and Dynamic Evaluation of Data Dependence Analysis. In Proceedings of the International Conference on Supercomputing, pages 107-116, July 1993.
23. M. K. Prabhu and K. Olukotun. Using Thread-Level Speculation to Simplify Manual Parallelization. In Proceedings of the Symposium on Principles and Practice of Parallel Programming, June 2003.
24. V. Sarkar. Determining Average Program Execution Times and their Variance. In Proceedings of the Conference on Programming Language Design and Implementation, pages 298-312, 1989.
25. V. Sarkar and J. Hennessy. Partitioning Parallel Programs for Macro-Dataflow. In Proceedings of the Conference on LISP and Functional Programming, pages 202-211, 1986.
26. G. Sohi, S. Breach, and T. N. Vijaykumar. Multiscalar Processors. In Proceedings of the 32nd International Symposium on Computer Architecture, June 1995.
27. J. G. Steffan. Hardware Support for Thread-Level Speculation. PhD thesis, Carnegie-Mellon University, April 2003.
28. J. G. Steffan, C. B. Colohan, A. Zhai, and T. C. Mowry. A Scalable Approach to Thread-Level Speculation. In Proceedings of the 27th International Symposium on Computer Architecture, pages 1-12, June 2000.
29. J. G. Steffan and T. C. Mowry. The Potential for Using Thread-Level Data Speculation to Facilitate Automatic Parallelization. In Proceedings of the 4th IEEE Symposium on High-Performance Computer Architecture, pages 2-13, February 1998.
30. J.-Y. Tsai and P.-C. Yew. The Superthreaded Architecture: Thread Pipelining with Run-Time Data Dependence Checking and Control Speculation. In Proceedings of the International Conference on Parallel Architecture and Compiler Techniques, pages 35-46, October 1996.
31. T. N. Vijaykumar and G. S. Sohi. Task Selection for a Multiscalar Processor. In Proceedings of the 31st International Symposium on Microarchitecture, December 1998.
32. E. Waingold et al. Baring It All to Software: Raw Machines. IEEE Computer, 30(9):86-93, 1997.
33. D. W. Wall. Predicting Program Behavior Using Real or Estimated Profiles. In Proceedings of the Conference on Programming Language Design and Implementation, volume 26, pages 59-70, June 1991.
34. D. B. West. Introduction to Graph Theory - Second Edition. Prentice-Hall, 2001.
35. H. H. Yang and D. F. Wong. Efficient Network Flow Based Min-Cut Balanced Partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(12), December 1996.
36. Y. Zhang, L. Rauchwerger, and J. Torrellas. Hardware for Speculative Run-Time Parallelization in Distributed Shared-Memory Multiprocessors. In Proceedings of the 4th IEEE Symposium on High-Performance Computer Architecture, pages 162-173, 1998.