All-to-all personalized exchange in generalized shuffle-exchange networks
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1684 | en_US |
dc.citation.issue |
16-18 | en_US |
dc.citation.spage |
1669 | en_US |
dc.citation.volume |
411 | en_US |
dc.citation.woscount |
4 | |
dc.contributor.author |
Chou, Well Y. | en_US |
dc.contributor.author |
Chen, Chiuyuan | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:07:10Z | |
dc.date.available |
2014-12-08T15:07:10Z | |
dc.date.issued |
2010-03-28 | en_US |
dc.description.abstract |
An all-to-all communication algorithm is said to be optimal if it has the smallest communication delay. Previous all-to-all personalized exchange algorithms are mainly for hypercube, mesh, and torus. In Yang and Wang (2000) [13], Yang and Wang proved that a multistage interconnection network (MIN) is a better choice for implementing all-to-all personalized exchange and they proposed optimal all-to-all personalized exchange algorithms for MINs. In Massini (2003)[9], Massini proposed a new optimal algorithm for MINs, which is independent of the network topology. Do notice that the algorithms in [9] and [13] work only for MINs with the unique path property (meaning that there is a unique path between each pair of source and destination) and satisfying N = 2(n), in which N is the number of processors, 2 means all the switches are of size 2 x 2, and n is the number of stages. In Padmanabhan (1991) [10], Padmanabhan proposed the generalized shuffle-exchange network (GSEN), which is a generalization of the shuffle-exchange network. Since a GSEN does not have the unique path property, the algorithms in [9] and [13] cannot be used. The purpose of this paper is to consider the all-to-all personalized exchange problem in GSENs. An optimal algorithm and several bounds will be proposed. (C) 2010 Published by Elsevier B.V. | en_US |
dc.identifier.doi |
10.1016/j.tcs.2009.10.026 | en_US |
dc.identifier.issn |
0304-3975 | en_US |
dc.identifier.journal |
THEORETICAL COMPUTER SCIENCE | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.tcs.2009.10.026 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/5625 | |
dc.identifier.wosnumber |
WOS:000276167000001 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Multistage interconnection networks | en_US |
dc.subject |
Shuffle-exchange networks | en_US |
dc.subject |
Omega network | en_US |
dc.subject |
Parallel and distributed computing | en_US |
dc.subject |
All-to-all communication | en_US |
dc.subject |
All-to-all personalized exchange | en_US |
dc.title |
All-to-all personalized exchange in generalized shuffle-exchange networks | en_US |
dc.type |
Article | en_US |
檔案
- 000276167000001.pdf (1.43 MB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Chou, W. Y., & Chen, C. (2010). All-to-all personalized exchange in generalized shuffle-exchange networks. THEORETICAL COMPUTER SCIENCE, 411(16-18), 1669–1684. https://doi.org/10.1016/j.tcs.2009.10.026
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/5625