Automatic partitioning of a program dependence graph into parallel tasks
作者： V. Sarkar
DOI: 10.1147/RD.355.0779
关键词: Graph partition 、 Program Dependence Graph 、 Parallel computing 、 Computer science
摘要:
acm.org
sci-hub.se 参考文章(68)
Vivek Sarkar, None, PTRAN—the IBM parallel translation system Parallel functional languages and compilers. pp. 309- 391 ,(1991) , 10.1145/107214.129260
K. W. Kennedy, Allan Kennedy Porterfield, Software methods for improvement of cache performance on supercomputer applications Rice University. ,(1989)
Keshav Pingali, Micah Beck, From Control Flow to Dataflow. international conference on parallel processing. pp. 43- 52 ,(1990)
Ravi Sethi, Jeffrey D. Ullman, Alfred V. Aho, Compilers: Principles, Techniques, and Tools ,(1986)
Paul Hudak, Benjamin Goldberg, Serial combinators: "optimal" grains of parallelism Functional Programming Languages and Computer Architecture. pp. 382- 399 ,(1985) , 10.1007/3-540-15975-4_49
Shahid H. Bokhari, Assignment Problems in Parallel and Distributed Computing ,(1987)
Michael Wolfe, Optimizing Supercompilers for Supercomputers ,(1989)
V. Sarkar, Ron Cytron, J. Ferrante, Experiences using control dependence in PTRAN languages and compilers for parallel computing. pp. 186- 212 ,(1990)
G. Gao, R. Olsen, V. Sarkar, R. Thekkath, Collective Loop Fusion for Array Contraction languages and compilers for parallel computing. pp. 281- 295 ,(1992) , 10.1007/3-540-57502-2_53
B. Noyce, J. Glauert, J. McGraw, S. Skedzielewski, R. Thomas, S. Allan, C. Kirkham, R. Oldehoeft, SISAL: streams and iteration in a single assignment language. Language reference manual, Version 1. 2. Revision 1 ,(1985)