论文信息 - Simulation of parallel time-critical programs with the DYNAMO system

Simulation of parallel time-critical programs with the DYNAMO system

An approach to the solution of the mapping problem for time-critical Occam2 programs for transputer networks is described. It is based on the idea of running the algorithm on the real transputer to obtain its temporal diagram and then deducing the near-optimal load distribution and/or network architecture. The method uses the genetic algorithm when looking for a mapping and demonstrates good agreement with experiments.<<ETX>>

A. Biriukov | D. Ulyanov

[1] Nicholas T. Karonis. Timing Parallel Programs that Use Message Passing , 1992, J. Parallel Distributed Comput..

[2] J. Ramanujam,et al. Cluster partitioning approaches to mapping parallel programs onto a hypercube , 1987, Parallel Comput..

[3] Philippe Chrétienne,et al. Mapping Graphs onto a Partially Reconfigurable Architecture , 1991, EDMCC.

[4] Virginia Mary Lo,et al. Temporal Communication Graphs: Lamport's Process-Time Graphs Augmented for the Purpose of Mapping and Scheduling , 1992, J. Parallel Distributed Comput..

[5] Burkhard Monien,et al. Embedding one interconnection network in another , 1990 .

[6] Peter Thanisch,et al. Assigning dependency graphs onto processor networks , 1991, Parallel Comput..

[7] S. Arunkumar,et al. A randomized heuristics for the mapping problem: The genetic approach , 1992, Parallel Comput..