Path selection for message passing in a circuit-switched multicomputer
SCIE
SCOPUS
- Title
- Path selection for message passing in a circuit-switched multicomputer
- Authors
- Lee, SG; Kim, J
- Date Issued
- 1996-06-15
- Publisher
- ACADEMIC PRESS INC JNL-COMP SUBSCRIPT
- Abstract
- This paper considers the problem of selecting contention-free or minimum-contention paths for a set of communicating tasks that have been mapped onto nodes in a multicomputer. Contention-free path selection results in guaranteed minimum communication delays for all messages sent along the selected paths-this is a particularly important in real-time applications. Minimum-contention path selection can achieve the same result if a small number of partitioned time intervals is used. However, both path selection problems can be shown to be NP-hard. Thus, a heuristic solution is proposed for general point-to-point interconnection networks. The quality of our solution is investigated by simulation on binary n-cube and torus interconnection networks, and it is shown that our method performs significantly better than alternative methods in the literature. (C) 1996 Academic Press, Inc.
- Keywords
- NETWORKS
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/21538
- DOI
- 10.1006/jpdc.1996.0083
- ISSN
- 0743-7315
- Article Type
- Article
- Citation
- JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, vol. 35, no. 2, page. 211 - 218, 1996-06-15
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.