Abstract
This paper studies the problem of routing and scheduling parallel I/O operations to minimize the time required to transfer data between processors and I/O devices. In particular, a 2-dimensional mesh architecture is considered in which routing is performed using wormhole switching and I/O nodes are placed on the periphery of the mesh. Two broad classes of data transfer mechanisms are examined: schedules with blocking (SB), in which packets may be temporarily blocked during transit, and schedules with no blocking (SNB), in which packets are never blocked in the network. For both classes, optimal scheduling is shown to be NP-complete, and heuristics are presented and experimentally evaluated via a detailed simulation. © 1999 Academic Press.
Recommended Citation
B. Narahari et al., "Routing and Scheduling I/O Transfers on Wormhole-Routed Mesh Networks," Journal of Parallel and Distributed Computing, vol. 57, no. 1, pp. 1 - 13, Elsevier, Apr 1999.
The definitive version is available at https://doi.org/10.1006/jpdc.1998.1506
Department(s)
Electrical and Computer Engineering
International Standard Serial Number (ISSN)
0743-7315
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Elsevier, All rights reserved.
Publication Date
01 Apr 1999
