Full metadata record
DC FieldValueLanguage
dc.contributor.authorHou, YMen_US
dc.contributor.authorWang, CMen_US
dc.contributor.authorTsai, MJen_US
dc.contributor.authorHsu, LHen_US
dc.date.accessioned2014-12-08T15:27:20Z-
dc.date.available2014-12-08T15:27:20Z-
dc.date.issued1998en_US
dc.identifier.isbn0-8186-8603-0en_US
dc.identifier.urihttp://hdl.handle.net/11536/19594-
dc.description.abstractFor distributed memory parallel computers, broadcast operations are widely used in a variety of applications. In this paper, we propose an efficient algorithm for broadcasting on an all-port wormhole-routed 2D tents with arbitrary size. The underlying network is assumed to support only the dimension-ordered unicast. By taking the advantage of the all-port model and the distance insensitivity of the wormhole routing, the proposed algorithm can greatly reduce the number of message-passing steps. In addition, it can be proved to be depth contention-free. The performance study in this paper clearly shows the advantage of the proposed algorithm.en_US
dc.language.isoen_USen_US
dc.titleBroadcasting on wormhole-routed 2D tori with arbitrary sizeen_US
dc.typeProceedings Paperen_US
dc.identifier.journal1998 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGSen_US
dc.citation.spage334en_US
dc.citation.epage341en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000078318400041-
Appears in Collections:Conferences Paper