Ismorphic routing on a toroidal mesh

Ismorphic routing on a toroidal mesh

0.00 Avg rating0 Votes
Article ID: iaor19982972
Country: United States
Volume: 8
Issue: 1
Start Page Number: 63
End Page Number: 73
Publication Date: Dec 1996
Journal: INFORMS Journal On Computing
Authors: ,
Keywords: computational analysis, scheduling
Abstract:

We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors {(xi, yi)|i = 1, 2, …, k}, where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this Isomorphic Routing. Our objective is to find the isomorphic routing schedule with the minimum makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems.

Reviews

Required fields are marked *. Your email address will not be published.