Temporal Communication Graphs: A New Graph Theoretic Model Mapping and Scheduling in Distributed Memory Systems

Abstract

The temporal communication graph is a new graph theoretic model of parallel computation that we have developed for the mapping of parallel computations to message-passing parallel architectures. The TCG integrates the two dominant models currently in use in the area of mapping, task assignment, partitioning, and scheduling: the static task graph and the DAG. The TCG augments these models with the capability to identify logically synchronous phases of communication and computation, and to describe the temporal behavior of a parallel algorithm in terms of these phases. This paper defines the TCG, illustrates its use for mapping and scheduling, and discusses a wide range of potentials uses for the TCG in the area of parallel programming environments.