完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYang, MHen_US
dc.contributor.authorTseng, YCen_US
dc.contributor.authorJian, MSen_US
dc.date.accessioned2014-12-08T15:41:49Z-
dc.date.available2014-12-08T15:41:49Z-
dc.date.issued2002-11-01en_US
dc.identifier.issn1016-2364en_US
dc.identifier.urihttp://hdl.handle.net/11536/28436-
dc.description.abstractThis paper considers the multi-node multicast problem in a multi-dimensional wormhole-routed torus/mesh, where there is an arbitrary number of source nodes, each intending to multicast a message to an arbitrary set of destinations. This problem requires a large amount of bandwidth and, thus, typically incurs heavy contention and congestion. Evenly balancing the traffic load around the network is critical to achieving good performance. We show how to use a network-partitioning approach to achieve this goal. Simulation results show significant improvement over existing results in 3D tori and meshes. This work is an extension of our earlier work [22] from 2D tori/meshes to higher dimensional ones.en_US
dc.language.isoen_USen_US
dc.subjectcollective communicationen_US
dc.subjectinterconnection networken_US
dc.subjectload balanceen_US
dc.subjectmeshen_US
dc.subjectmulticasten_US
dc.subjectparallel processingen_US
dc.subjecttorusen_US
dc.subjectwormhole routingen_US
dc.titleMulti-node multicast in multi-dimensional wormhole tori and meshes with load balanceen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF INFORMATION SCIENCE AND ENGINEERINGen_US
dc.citation.volume18en_US
dc.citation.issue6en_US
dc.citation.spage959en_US
dc.citation.epage980en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000179148700006-
dc.citation.woscount0-
顯示於類別:期刊論文