 
Summary: 328 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 4, NO. 3, MARCH 1993
A Generalized Scheme for
Mapping Parallel Algorithms
Viph Chaudhary, Member, IEEE, and J. K. Agganval, Fellow, IEEE
AbstractThe mapping problem arises when the dependency
structure of a parallel algorithm differs from the processor
interconnection of the parallel computer or when the number
of processes generated by the algorithm exceeds the number
of processors available. The mapping problem (also known as
task allocation) has been widely studied. We propose a new
generalized mapping strategy that uses a combination of graph
theory, mathematical programming, and heuristics. The key dif
ference between our strategy and those proposed previously is the
interdependence between the algorithm and the architecture. We
use the knowledge from the given algorithm and the architecture
to guide the mapping. The approach begins with a graphical
representation of the parallel algorithm (problem graph) and the
parallel computer (host graph). Using these representations, we
generate a new graphical representation (extended host graph)
on which the problem graph is mapped. We use an accurate
