Efficient heuristic for code partitioning

Parallel Computing

Volumn 26, Issue 4, 2000, Pages 399-426

  Ayed, Moez ^a   Gaudiot, Jean Luc ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; DATA FLOW ANALYSIS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; POLYNOMIALS; THEOREM PROVING;

CODE PARTITIONING; DIRECTED ACYCLIC GRAPH; DISTRIBUTED MEMORY MULTIPROCESSOR; PROCESSING ELEMENT; TASK CLUSTERING; TASK GRAPH; TASK MERGING;

PARALLEL PROCESSING SYSTEMS;

EID: 0034158755     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00110-6     Document Type: Article

References (12)

1. M. Ayed, Automatic code partitioning for distributed memory multiprocessors, Ph.D. Thesis, University of Southern California, EE Systems Department, Computer Engineering Division, November 1996, Technical Report Number: CENG 96-36.
2. Gerasoulis A., Yang T. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems. 4(6):1993;686-701.
3. M. Haines, W. Bohm, Towards a distributed memory implementation of sisal, Technical Report CS-91-123, Computer Science Department, Colorado State University, Fort Collins, CO 80523, November 1991.
4. M. Haines, W. Bohm, A comparison of explicit and implicit programming styles for distributed memory multiprocessors, Technical Report CS-93-104, Colorado State University, March 1993.
5. M.D. Haines, Distributed runtime support for task and data management, Ph.D. Dissertation CS-93-110, Colorado State University, August 1993.
6. Hiranandani S., Kennedy K., Tseng C.W. Compiling fortran d for mimid distributed-memory machines. CACM. 35(8):1992;66-80.
7. V. Sarkar, J. Hennessey, Compile-time partitioning and scheduling of parallel programs, in: Proceedings of the SIGPLAN 1986 Symposium on Compiler Construction, Palo Alto, CA, June 1986, ACM, New York, pp. 17-26.
8. V. Sarkar, J. Hennessey, Partioning parallel programs for macro-dataflow, in: Proceedings of the 1986 ACM Conference on Lisp and Functional Programming, August 1986, pp. 202-211.
9. V. Sarkar, Partitioning and scheduling parallel programs for execution on multiprocessors, Ph.D. Thesis CSL-TR-87-328, Stanford University, Stanford, CA 94305-2192, April 1987.
10. V. Sarkar, S. Skedzielewski, P. Miller, An automatically partitioning compiler for sisal, Technical Report UCRL-98289, Lawrence Livermore National Laboratory, Livermore CA 94550, December 1988.
11. T. Yang, Scheduling and code generation for parallel architectures, Ph.D. Thesis, Rutgers University, New Brunswick, NJ, May 1993.
12. Yang T., Gerasoulis A. Dsc: scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems. 5(9):1994;951-967.