Avoiding memory contention on tightly coupled multiprocessors

We propose a novel method of scheduling memory access on a non blocking interconnection network that provides only one-to-one communication. Conflicts at the switches can be avoided if the accesses are scheduled so that no two processors attempt to access the same memory at the same time. We show how such a scheduling problem can be mapped to an edge coloring problem for a directed graph and present algorithms for solving that problem. We give examples of the application of the algorithm and present simulation results.<
>