Dominant representations: a paradigm for mapping parallel computations
Ajay Mohindra, S. Yalamanchili · 2003
Proposes a simple paradigm for constructing heuristics for the static assignment of parallel programs onto asynchronous, distributed memory, multiprocessor architectures. The proposed paradigm involves capturing the dominant computation and communication components of an application and using this relatively simpler program representation to determine an assignment. Thus, the mapping problem is reduced from its most general form to a simpler form which often has optimal solutions.>