Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks
檔案
- 000248864800004.pdf (546.6 KB, Adobe PDF)
日期
2007-10-01
系所
期刊名稱
JOURNAL OF COMBINATORIAL OPTIMIZATION
卷期與頁次
第 14 卷第 2-3 期,頁 131–142
ISSN
1382-6905
語言
英文
摘要
All-to-all personalized exchange occurs in many important applications in parallel processing. In the past two decades, algorithms for all-to-all personalized exchange were mainly proposed for hypercubes, meshes, and tori. Recently, Yang and Wang (IEEE Trans Parallel Distrib Syst 11:261-274, 2000) proposed an optimal all-to-all personalized exchange algorithm for binary (each switch is of size 2x2) banyan multistage interconnection networks. It was pointed out in Massini (Discret Appl Math 128:435-446, 2003) that the algorithm in Yang, Wang (IEEE Trans Parallel Distrib Syst 11:261-274, 2000) depends on the network topologies and requires pre-computation and memory allocation for a Latin square. Thus in (Discret Appl Math 128:435-446, 2003), Massini proposed a new optimal algorithm, which is independent of the network topologies and does not require pre-computation or memory allocation for a Latin square. Unfortunately, Massini's algorithm has a flaw and does not realize all-to-all personalized exchange. In this paper, we will correct the flaw and generalize Massini's algorithm to be applicable to d-nary (each switch is of size dxd) banyan multistage interconnection networks.
關鍵詞
multistage interconnection networkbanyan networkall-to-all communicationall-to-all personalized exchangelatin square所屬典藏
會議論文引用此條目
Liu, V. W., Chen, C., & Chen, R. B. (2007). Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks. JOURNAL OF COMBINATORIAL OPTIMIZATION, 14(2-3), 131–142. https://doi.org/10.1007/s10878-007-9065-5
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/3985