FASTEST: A practical low-complexity algorithm for compile-time assignment of parallel programs to multiprocessors

IEEE Transactions on Parallel and Distributed Systems

Volumn 10, Issue 2, 1999, Pages 147-159

  Kwok, Yu Kwong ^a,b   Ahmad, Ishfaq ^a,c  

^a IEEE   (Hong Kong)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Automatic parallelization; Compile time scheduling; Multiprocessors; Parallel algorithm; Parallel processing; Parallel programming tool; Random neighborhood search; Task graphs

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; GRAPH THEORY; PARALLEL ALGORITHMS; PROGRAM COMPILERS; RANDOM PROCESSES; RESPONSE TIME (COMPUTER SYSTEMS);

RANDOM NEIGHBORHOOD SEARCH; TASK GRAPHS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033076467     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.752781     Document Type: Article

References (26)

1. I. Ahmad, Y.-K. Kwok, M.-Y. Wu, and W. Shu, "Automatic Parallelization and Scheduling of Programs on Multiprocessors Using CASCH," Proc. 1997 Int'l Conf. Parallel Processing, pp. 288-291, Aug. 1997.
2. I. Ahmad and Y.-K. Kwok, "Optimal and Near-Optimal Allocation of Precedence-Constrained Tasks to Parallel Processors: Defying the High Complexity Using Effective Search Techniques," Proc. 1998 Int'l Conf. Parallel Processing, pp. 424-431, Aug. 1998.
3. D.-K. Chen and P.-C. Yew, "On Effective Execution of Non-Uniform DOACROSS Loops," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 463-476, May 1996.
4. M. Cosnard and M. Loi, "Automatic Task Graph Generation Techniques," Parallel Processing Letters, vol. 5, no. 4, pp. 527-538, 1995.
5. H. El-Rewini, H.H. Ali, and T.G. Lewis, "Task Scheduling in Multiprocessing Systems," Computer, pp. 27-37, Dec. 1995.
6. T. Fahringer, "Compile-Time Estimation of Communication Costs for Data Parallel Programs," J. Parallel and Distributed Computing, vol. 39, pp. 46-65, 1996.
7. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
8. M. Girkar and C.D. Polychronopoulos, "Automatic Extraction of Functional Parallelism from Ordinary Programs," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 166-178, 1992.
9. M. Gupta and P. Banerjee, "Compile-Time Estimation of Communication Costs on MultiComputers," Proc. Sixth Int'l Parallel Processing Symp., Mar. 1992.
10. J.J. Hwang, Y.C. Chow, F.D. Anger, and C.Y Lee, "Scheduling Precedence Graphs in Systems with Interprocessor Communication Times," SIAM J. Computing, vol. 18, no. 2, pp. 244-257, Apr. 1989.
11. H. Kasahara and S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing," IEEE Trans. Computers, vol. 33, no. 11, pp. 1,023-1,029, Nov. 1984.
12. K. Kennedy, N. McIntosh, and K.S. Mckinley, "Static Performance Estimation in a Parallelizing Compiler," Technical Report TR 91-174, Dept. of Computer Science, Rice Univ., Dec. 1991.
13. B.W. Kernighan and S. Lin, "An Effective Heuristic Procedure for Partitioning Graphs," Bell Systems Technical J., vol. 49, pp. 291-308, Feb. 1970.
14. Y.-K. Kwok and I. Ahmad, "Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs onto Multi-Processors," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 506-521, May 1996.
15. Y.-K. Kwok and I. Ahmad, "Benchmarking the Task Graph Scheduling Algorithms," Proc. 12th Int'l Parallel Processing Symp., pp. 531-537, Apr. 1998.
16. Y.-K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors," ACM Computing Surveys, accepted for publication and to appear.
17. B. Lee, A.R. Hurson, and T.Y. Feng, "A Vertically Layered Allocation Scheme for Data Flow Systems," J. Parallel and Distributed Computing, vol. 11, pp. 175-187, 1991.
18. Z. Li and P.-C. Yew, "Program Parallelization with Interprocedural Analysis," J. Supercomputing, vol. 2, no. 2, pp. 225-244, Oct. 1988.
19. Z. Li, P.-C. Yew, and C.-Q. Zhu, "An Efficient Data Dependency Analysis for Parallelizing Compilers," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 1, pp. 26-34, Jan. 1990.
20. M.A. Palis, J.-C. Liou, and D.S.L. Wei, "Task Clustering and Scheduling for Distributed Memory Parallel Architectures," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 46-55, Jan. 1996.
21. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, N.J.: Prentice Hall, 1982.
22. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors. Cambridge, Mass.: MIT Press, 1989.
23. B. Shirazi, M. Wang, and G. Pathak, "Analysis and Evaluation of Heuristic Methods for Static Scheduling," J. Parallel and Distributed Computing, no. 10, pp. 222-232, 1990.
24. G.C. Sih and E.A. Lee, "A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 75-87, Feb. 1993.
25. M.-Y. Wu and D.D. Gajski, "Hypertool: A Programming Aid for Message-Passing Systems," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 3, pp. 330-343, July 1990.
26. T. Yang and A. Gerasoulis, "DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, pp. 951-967, Sept. 1994.