Mapping arbitrary heterogeneous task graphs onto arbitrary heterogeneous system graph

International Journal of Foundations of Computer Science

Volumn 12, Issue 5, 2001, Pages 599-628

  Eshaghian, Mary Mehrnoosh ^a  

^a ROCHESTER INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 75149177397     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054101000680     Document Type: Article

References (36)

1. A. Beguelin, J. J. Dongarra, G. A. Geist, R. Manchek, and V. S. Sunderam. Graphical development tools for network-based concurrent supercomputing. In Proceedings of Supercomputing 91, pages 435-444, 1991.
2. F. Berman. Experience with an automatic solution to the mapping problem. In L. H. Jamieson, D. B. Gannon, and R. J. Douglass, editors, The Characteristics of Parallel Algorithms, pages 307-334. MIT Press, Cambridge, MA, 1987.
3. F. Berman and L. Snyder. On mapping parallel algorithms into parallel architectures. Journal of Parallel and Distributed Computing, pages 439-458, April 1987.
4. S. H. Bokhari. On the mapping problem. IEEE Trans, on Computers, c-30(3):207- 214, March 1981.
5. S. Chen and M. Eshaghian. A fast recursive mapping algorithm. Concurrency: Practice and Experience, 7(5):391-409, August 1995.
6. S. Chen, M. Eshaghian, A. Khokhar, and M. Shaaban. A selection theory and methodology for heterogeneous supercomputing. In Proc. Workshop on Heterogeneous Processing, pages 15-22, April 1993.
7. S. Chen, M. M. Eshaghian, R. F. Freund, J. L. Potter, and Y. Wu. Evaluation of two programming paradigms for heterogeneous computing. Journal of Parallel and Distributed Computing, 31(l):41-55, November 1995.
8. S. Chen, M. M. Eshaghian, and Y. Wu. Mapping arbitrary non-uniform task graphs onto arbitrary non-uniform system graphs. In 1995 International Conference on Parallel Processing, volume II, pages 191-195, August 1995.
9. Song Chen. mapping of Portable Parallel Programs. PhD thesis, New Jersey Institute of Technology, 1995.
10. K. Efe. Heuristic models of task assignment scheduling in distributed systems. IEEE Computer, 15(6):50-56, 1982.
11. H. El-Rewini and T. G. Lewis. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing, pages 138-153, September 1990.
12. H. El-Rewini, T. G. Lewis, and H. H. Ali. Task Scheduling in Parallel and Distributed Systems. Prentice Hall, Englewood Cliffs, NJ, 1994.
13. F. Ercal, J. Ramanujam, and P. Sadayappan. Task allocation onto a hypercube by recursive mincut bipartitioning. Journal of Parallel and Distributed Computing, pages 33-44, October 1990.
14. M. Eshaghian and M. Shaaban. Cluster-M parallel programming paradigm. International Journal of High Speed Computing, 6(2):287-309, June 1994.
15. I. Foster and S. Tuecke. Parallel programming with PCN. Technical report, Argonne National Laboratory, University of Chicago, January 1993.
16. R. F. Freund and H. J. Siegel. Guest Editor's Introduction: Heterogeneous Processing. IEEE Computer, 26(6):13-17, June 1993.
17. Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy Sunderam. PVM: Parallel Virtual Machine. MIT Press, 1994.
18. T. C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9(6):841-848, 1961.
19. Ashfaq A. Khokhar, Viktor K. Prasanna, Muhammad E. Shaaban, and Cho-Li Wang. Heterogeneous computing: Challenges and opportunities. IEEE Computer, 26(6):18-27, June 1993.
20. B. Narahari L. Tao and Y. C. Zhao. Heuristics for mapping parallel computa tions to heterogeneous parallel architectures. In Proc. Workshop on Heterogeneous Processing, pages 36-41, April 1993.
21. C. Leangsuksun and J. Potter. Problem representation for an automatic mapping algorithm on heterogeneous processing environment. In Proc. Workshop on Heterogeneous Processing, pages 48-56, April 1993.
22. S. Lee and J. K. Aggarwal. A mapping strategy for parallel processing. IEEE Trans, on Computers, 36:433-442, April 1987.
23. V. M. Lo. Heuristic algorithms for task assignment in distributed systems. IEEE Trans, on Computers, C-37( 11): 1384-1397, November 1988.
24. V. M. Lo, S. Rajopadhye, S. Gupta, D. Keldsen, M. A. Mohamed, and J. A. Telle. Oregami: Software tools for mapping parallel computations to parallel architectures. In Proc. International Conference on Parallel Processing, 1990.
25. C. McCreary and H. Gill. Automatic determination of grain size for efficient parallel processing. Communications of ACM, 32(9): 1073-1078, September 1989.
26. R. Ponnusamy, J. Saltz, R. Das, C. Koelbel, and A. Choudhary. A runtime data mapping scheme for irregular problems. In Proc. Scalable High Performance Computing Conference, pages 216-219, May 1992.
27. S. Prakash and A. C. Parker. A design method for optimal selection of applicationspecific heterogeneous multiprocessor systems. In Proc. Workshop on Heterogeneous Processing, pages 75-80, April 1992.
28. V. Sarkar. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. The MIT Press, Cambridge, MA, 1989.
29. C. Shen and W. Tsai. A graph matching approach to optimal task assignment in distributed computing systems using a minmax criterion. IEEE Trans, on Computers, c-34(3): 197-203, March 1985.
30. H. J. Siegel, J. K. Antonio, R. C. Metzger, M. Tan, and Y. A. Li. Heterogeneous computing. In A. Y. Zomaya, editor, Handbook of Parallel and Distributed Computing, pages 725-761. McGraw-Hill, New York, 1995.
31. H. S. Stone. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Trans, on Software Engineering, SE-3(l):85-93, January 1977.
32. M. Wang, S. Kim, M. Nichols, R. Freund, and H. J. Siegel. Augmenting the optimal selection theory for superconcurrency. In Proc. Workshop on Heterogeneous Processing, pages 13-21, Mar. 1992.
33. M. Y. Wu and D. Gajski. Hypertool: A programming aid for message-passing systems. IEEE Trans, on Parallel and Distributed Systems, 1(3):101-119, 1990.
34. Ying-Chieh Wu. Portable Programming for high-performance Heterogeneous Computing. PhD thesis, New Jersey Institute of Technology, 1996.
35. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans, on Parallel and Distributed Systems, 5(9):951- 967, September 1994.
36. Walter Yogi. Experimental studies of an algorithm for mapping heterogeneous tasks onto heterogeneous systems. Master's thesis, California State University Long Beach, 1998.