DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, SG | - |
dc.contributor.author | Kim, J | - |
dc.date.accessioned | 2016-03-31T14:19:48Z | - |
dc.date.available | 2016-03-31T14:19:48Z | - |
dc.date.created | 2009-02-28 | - |
dc.date.issued | 1996-06-15 | - |
dc.identifier.issn | 0743-7315 | - |
dc.identifier.other | 1996-OAK-0000009467 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/21538 | - |
dc.description.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. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS INC JNL-COMP SUBSCRIPT | - |
dc.relation.isPartOf | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | - |
dc.subject | NETWORKS | - |
dc.title | Path selection for message passing in a circuit-switched multicomputer | - |
dc.type | Article | - |
dc.contributor.college | 컴퓨터공학과 | - |
dc.identifier.doi | 10.1006/jpdc.1996.0083 | - |
dc.author.google | LEE, SG | - |
dc.author.google | KIM, J | - |
dc.relation.volume | 35 | - |
dc.relation.issue | 2 | - |
dc.relation.startpage | 211 | - |
dc.relation.lastpage | 218 | - |
dc.contributor.id | 10074421 | - |
dc.relation.journal | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCI | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v.35, no.2, pp.211 - 218 | - |
dc.identifier.wosid | A1996UY65100010 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 218 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 211 | - |
dc.citation.title | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | - |
dc.citation.volume | 35 | - |
dc.contributor.affiliatedAuthor | Lee, SG | - |
dc.contributor.affiliatedAuthor | Kim, J | - |
dc.identifier.scopusid | 2-s2.0-0030585480 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 3 | - |
dc.type.docType | Article | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.