Architecture-independent graphical tool for automatic contention-free process-to-processor mapping

Journal of Supercomputing

Volumn 18, Issue 2, 2001, Pages 115-139

  Shen, Hong ^a   Lor, Sam ^b   Maheshwari, Piyush ^c  

^a GRIFFITH UNIVERSITY   (Australia)

^b UNIVERSITY OF QUEENSLAND   (Australia)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; DATA COMMUNICATION SYSTEMS; GRAPHICAL USER INTERFACES; HEURISTIC PROGRAMMING; MULTITASKING; PARALLEL PROCESSING SYSTEMS; TIME SHARING PROGRAMS;

CONTENTION FREE MAPPING; GRAPH EDITING SYSTEM; GRAPHICAL MAPPING TOOL; HEURISTIC ALGORITHM; PARALLEL COMPUTERS; PARALLEL PROGRAMS; PROCESS TO PROCESSOR MAPPING; TASK MAPPING;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0035249714     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008171232465     Document Type: Article

References (19)

1. T. Baba, Y. Iwamoto, and T. Yoshinaga. A network-topology independent task allocation strategy for parallel computers. Supercomputing, 878-887, 1990.
2. F. Berman. Experience with an Automatic solution to the Mapping Problem. In The Characteristics of Parallel Algorithms, pp. 307-334, MIT Press, Cambridge, MA, 1987.
3. F. Berman. On mapping parallel algorithms into parallel architectures. Journal of Parallel and Distributed Computing, 4:439-458, 1987.
4. S.H. Bokhari. On the mapping problem. IEEE Transactions on Computers, 30:207-214, 1981.
5. S.H. Bokhari. A network flow model for load balancing in circuit-switched multicomputers. IEEE Transactions on Parallel and Distributed Systems, 4: 1993.
6. W. Chen, M.F.M. Stallman, and E.F. Gehringer. Hypercube embedding heuristics: An evaluation. International Journal of Parallel Programming, 18:505-549, 1989.
7. M. Cosnard and D. Trystram. Parallel Algorithms and Architectures. International Thomson Computer Press, 1995.
8. P. Eades and R. Tamassia. Algorithms for drawing graphs: An annotated bibliography. Technical report CS-09-89. Department of Computer Science, Brown University, 1989.
9. H. El-Rewini, T.G. Lewis, and H.H. Ali. Task Scheduling in Parallel and Distributed Systems. Prentice-Hall, Englewood Cliffs, NJ, 1994.
10. M. Himsolt. GraphEd: An interactive graph editor. In Proceedings of STACS 89, Lecture Notes in Computer Science, Vol. 349, pp. 532-533. Springer-Verlag, Berlin and New York, 1989.
11. M. Himsolt. GraphEd user manual. Fakultät für Informatik, Universität Passau, Germany, 1990.
12. O. Kramer and H. Muhlenbein. Mapping strategies in message based multiprocessor systems. In Proc. PARLE'87, Lecture Notes in Computer Science, Vol. 258, pp. 213-225. Springer-Verlag, Berlin and New York. 1987.
13. V.M. Lo. Heuristic algorithms for task assignment in distributed systems. IEEE Transactions on Computers, 37:1384-1397, 1988.
14. V.M. Lo, S. Rajopadhye, S. Gupta, D. Keldsen, M.A. Mohamed, B. Nitzberg, J.A. Telle, and X. Zhong. OREGAMI: Tools for mapping parallel computations to parallel architectures. International Journal of Parallel Programming, 20:237-270, 1991.
15. S. Lor, H. Shen, and P. Maheshwari. Divide-and-conquer mapping of parallel programs onto hypercube computers. In Proceedings of the 18th Australasian Computer Science Conference, pp. 347-355, Adelaide, Australia, February 1995.
16. M.G. Norman and P. Thanisch. Models of machines and computations for mapping in multicomputers. ACM Computing Surveys, 25: 1993.
17. H. Shen. Fast path-disjoint routing in transputer networks. Microprocessing and Microprogramming, 33:21-31, 1991.
18. H. Shen. Self-adjusting mapping: A heuristic mapping algorithm for mapping parallel programs onto transputer networks. The Computer Journal, 35:71-80, 1992.
19. P. Sadayappan, F. Ercal, and J. Ramanujam. Cluster partitioning approaches to mapping parallel programs onto a hypercube. Parallel Computing, 13:1-16, 1990.