Continuous-message routing on fixed-connection networks
Thesis/Dissertation
·
OSTI ID:6344289
Message routing is known to be an important problem in parallel computation; besides its intrinsic interest it is often used as a subroutine in parallel algorithms to transmit the results of subcomputations to the processors that will use them. Here, the problem of continuous routing is studied in which, unlike commonly studied one-wave routing, messages are allowed to be generated at arbitrary times. Thus, continuous routing can more realistically model the interprocessor communication appearing in a long parallel computation. The feasibility problem of continuously routing a set of messages with individual deadlines on mesh-connected processor arrays is studied. In the feasibility problem, it was to be determined whether every message can be at its destination by the deadline. These problems are in general very hard - testing feasibility is NP-hard on the linear array. A search is made for efficient probabilistic routing algorithms for periodic continuous routing. In this problem it is assumed that one permutation becomes available every constant number of time steps and has to be routed as fast as possible.
- Research Organization:
- Pennsylvania State Univ., University Park (USA)
- OSTI ID:
- 6344289
- Country of Publication:
- United States
- Language:
- English
Similar Records
Distributed multi-destination routing in hypercube multiprocessors
An {Omega}({radical}log log n) lower bound for routing in optical networks
Relay approach message routing in hypercube multiprocessors
Conference
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:6688679
An {Omega}({radical}log log n) lower bound for routing in optical networks
Conference
·
Fri Nov 05 23:00:00 EST 1993
·
OSTI ID:10107445
Relay approach message routing in hypercube multiprocessors
Conference
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5114040