A platform independent parallelising tool based on graph theoretic models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1981, Issue , 2001, Pages 154-167

  Sinnen, Oliver ^a   Sousa, Leonel ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMAL MAPPING; OBJECT ORIENTED PROGRAMMING; PARALLEL PROGRAMMING; SCHEDULING ALGORITHMS;

DEPENDENCE ANALYSIS; GRAPH THEORETIC MODELING; GRAPH-THEORETIC MODELS; HIERARCHICAL GRAPHS; OBJECT-ORIENTED FRAMEWORKS; PLATFORM INDEPENDENCE; PLATFORM INDEPENDENT; SEQUENTIAL PROGRAMMING;

GRAPH THEORY;

EID: 23044527771     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44942-6_12     Document Type: Conference Paper

References (25)

1. [1] Ishfaq Ahmad, Yu-Kwong Kwok, Min-You Wu, and Wei Shu. Automatic parallelization and scheduling of programs on multiprocessors using CASCH. In Proceedings of the 1997 International Conference on Parallel Processing (ICPP’97), pages 288–291, Bloomingdale, Illinois, USA, August 1997.
2. [2] Hesham El-Rewini and T. G. Lewis. Scheduling parallel program tasks onto arbitray target machines. Journal of Parallel and Distributed Computing, 9(2):138–153, June 1990.
3. [3] T. Yang and A. Gerasoulis. PYRROS: static scheduling and code generation for message passing multiprocessors. In Proc. of 6th ACM International Conference on Supercomputing, pages 428–437, Washington D.C, July 1992.
4. [4] Rajeev Mandayam Vokkarne. Distributed execution environments for the CODE 2.0 parallel programming system. Master’s thesis, University of Texas at Austin, May 1995.
5. [5] Guido Wirtz. Developing parallel programs in a graph-based environment. In D. Trystram, editor, Proc. Parallel Computing 93, Grenoble, France, pages 345–352, Amsterdam, September 1993. Elsevier Science Publ., North Holland.
6. [6] Elena V. Trichina and Juha Oinonen. Parallel program design in visual environment. In IEEE International Conference on High Performance Computing, Bangalore, India, December 1997.
7. [7] V. Sarkar. Partitionning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press, Cambridge MA, 1989.
8. [8] D.P. Darbha, S.; Agrawal. Optimal scheduling algorithm for distributed-memory machines. IEEE Transactions on Parallel and Distributed Systems, 9(1):87–95, January 1998.
9. [9] Jing-Chiou Liou and M.A. Palis. A new heuristic for scheduling parallel programs on multiprocessor. In 1998 International Conference on Parallel Architectures and Compilation Techniques, pages 358–365, October 1998.
10. [10] Virginia M. Lo. Temporal Communication Graphs: Lamport’s process-time graphs augmented for the purpose of mapping and scheduling. Journal of Parallel and Distributed Computing, 16(4), December 1992.
11. [11] Tao Yang and Cong Fu. Heuristic algorithms for scheduling iterative task computations on distributed memory machines. IEEE Transactions on Parallel and Distributed Systems, 8(6):608–622, June 1997.
12. [12] A. Gerasoulis and T. Yang. A comparison of clustering heuristics for scheduling DAGs on muliprocessors. Journal of Parallel and Distributed Computing, 16(4):276–291, December 1992.
13. [13] A. A. Khan, Carolyn L. McCreary, and M. S. Jones. A comparison of multiprocessor scheduling heursitics. Technical Report ncstrl.auburn eng/CSE94-02, Department of Compiter Science and Engineering, Auburn University, Auburn, AL 36849, January 1994.
14. [14] Y. Kwok and I. Ahmad. Benchmarking the task graph scheduling algorithms. In Proc. of the 1st Merged Int. Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS/SPDP-98), pages 531–537, Orlando, Florida, USA, April 1998.
15. [15] Yu-Kwong Kwok and Ishfaq Ahmad. A comparison of parallel search-based algorithms for multiprocessors scheduling. In Proc. of the 2nd European Conference on Parallel and Distributed Systems (EURO-PDS’98), Vienna, Austria, July 1998.
16. [16] Gilbert C. Sih and Edward A. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems, 4(2):175–186, February 1993.
17. [17] Yu-Kwong Kwok and Ishfaq Ahmad. Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures. In Proc. of the 7th Symposium on Parallel and Distributed Processing (SPDP’95), pages 36–43, Dallas, Texas, USA, October 1995.
18. [18] Oliver Sinnen and Leonel Sousa. A comparative analysis of graph models to develop parallelising tools. In Proc. of 8th IASTED Int’l Conference on Applied Informatics (AI’2000), pages 832–838, Innsbruck, Austria, February 2000.
19. [19] Oliver Sinnen and Leonel Sousa. A classification of graph theoretic models for parallel computing. Technical Report RT/005/99, INESC, Instituto Superior T´ecnico, Technical University of Lisbon, Lisbon, Portugal, May 1999.
20. [20] Sun Yuan Kung. VLSI Array Processors. Information and System Sciences Series. Prentice Hall, Englewood Cliffs, New Jersey 07632, 1988.
21. [21] Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
22. [22] 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. Int. Journal of Parallel Programming, 20(3):237–270, June 1991.
23. [23] Utpal Banerjee, Rudolf Eigenmann, Alexandru Nicolau, and David A. Padua. Automatic program parallelization. Proc. of the IEEE, 81(2):211–243, February 1993.
24. [24] Keshab K. Parhi. Algorithm transformation techniques for concurrent processors. Proc. of the IEEE, 77(12):1879–1895, December 1989.
25. [25] KeshabK. Parhi and David G. Messerschmitt. Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding. IEEE Transactions on Computers, 40(2):178–195, December 1991.