ANDES: Evaluating mapping strategies with synthetic programs

Abstract This paper presents the ANDES performance evaluation tool. ANDES is based on the synthetic execution of parallel programs and it is used for the evaluation of mapping strategies. The Meganode, a distributed memory parallel computer, is considered as our target architecture. ANDES takes into account a benchmark of quantitative models of parallel algorithms and a set of mapping strategies (greedy and iterative algorithms are used). We show how this tool allows an extensive comparison of mapping strategies by using the benchmark, the mapping strategies and different cost functions.

[1]  F. Glover,et al.  In Modern Heuristic Techniques for Combinatorial Problems , 1993 .

[2]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[3]  Jack J. Dongarra,et al.  The PVM Concurrent Computing System: Evolution, Experiences, and Trends , 1994, Parallel Comput..

[4]  Jack Dongarra,et al.  Environments and Tools for Parallel Scientific Computing , 1993 .

[5]  Shahid H. Bokhari,et al.  Control of Distributed Processes , 1978, Computer.

[6]  Scott F. Midkiff,et al.  Processor and Link Assignment in Multicomputers Using Simulated Annealing , 1988, ICPP.

[7]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[8]  Brigitte Plateau,et al.  ALPES: a tool for the performance evaluation of parallel programs , 1993 .

[9]  Hironori Kasahara,et al.  Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.

[10]  Tao Yang,et al.  PYRROS: static task scheduling and code generation for message passing multiprocessors , 1992 .

[11]  Denis A. Nicole,et al.  The Virtual Channel Router , 1993 .

[12]  Virginia Mary Lo,et al.  Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[13]  Inmos Limited,et al.  OCCAM 2 reference manual , 1988 .

[14]  J. Paris,et al.  Parallel application design: The simulation approach with HASTE , 1995, Future Gener. Comput. Syst..

[15]  Hesham El-Rewini,et al.  Introduction to Parallel Computing , 1992 .

[16]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[17]  Chung-Yee Lee,et al.  Parallel machines scheduling with nonsimultaneous machine available time , 1991, Discret. Appl. Math..

[18]  Virginia Mary Lo.  Algorithms for Static Task Assignment and Symmetric Contraction in Distributed Computing Systems , 1988, ICPP.

[19]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

[20]  Jean-Louis Pazat.  Outils pour la programmation d'un multiprocesseur à mémoires distribuées , 1989 .

[21]  Sanjay V. Rajopadhye,et al.  OREGAMI: Software Tools for Mapping Parallel Computations to Parallel Architectures , 1990, ICPP.

[22]  Michael G. Norman,et al.  Models of machines and computation for mapping in multicomputers , 1993, CSUR.

[23]  D. Marini,et al.  Transputer Applications and Systems '94 , 1994 .