Open Access System for Information Sharing

Login Library

 

Article
Cited 3 time in webofscience Cited 0 time in scopus
Metadata Downloads

Path selection for message passing in a circuit-switched multicomputer

Title
Path selection for message passing in a circuit-switched multicomputer
Authors
Lee, SGKim, J
POSTECH Authors
Lee, SGKim, J
Date Issued
Jan-1996
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
http://oasis.postech.ac.kr/handle/2014.oak/21538
ISSN
0743-7315
Article Type
Article
Citation
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, vol. 35, no. 2, page. 211 - 218, 1996-01
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

 LEE, SUNG GU
Dept of Electrical Enginrg
Read more

Views & Downloads

Browse