Fault-tolerant multicast with traffic-balancing in hypercubes

Hong Shen

Fault-tolerant multicast with traffic-balancing in hypercubes

Hong Shen

Griffith University Queensland

研究成果: Paper › 同行評審

1 引文斯高帕斯（Scopus）

摘要

Multicast is an important interprocessor communication pattern existing in various parallel application algorithms. This paper proposes a new multicast algorithm for hypercube computers that not only minimizes the number of hops required for delivery of the message and keeps a least possible amount of traffic, but also takes into consideration of balancing traffic among the active processors to maximize the parallelism in communication. Our algorithm has a time complexity of O(nN) for fault-tolerant multicasting in a hyper-cube of N = 2 ⁿ processors containing an arbitrary number of faulty processors.

原文	English
頁面	415-421
頁數	7
出版狀態	Published - 1996
對外發佈	是
事件	Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN - Beijing, China 持續時間: 12 6月 1996 → 14 6月 1996

Conference

Conference	Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN
城市	Beijing, China
期間	12/06/96 → 14/06/96

其它文件與鏈接

Link to publication in Scopus

引用此

@conference{4a2ebb2f64364cc49ddaf0bca19579ff,

title = "Fault-tolerant multicast with traffic-balancing in hypercubes",

abstract = "Multicast is an important interprocessor communication pattern existing in various parallel application algorithms. This paper proposes a new multicast algorithm for hypercube computers that not only minimizes the number of hops required for delivery of the message and keeps a least possible amount of traffic, but also takes into consideration of balancing traffic among the active processors to maximize the parallelism in communication. Our algorithm has a time complexity of O(nN) for fault-tolerant multicasting in a hyper-cube of N = 2 n processors containing an arbitrary number of faulty processors.",

author = "Hong Shen",

year = "1996",

language = "English",

pages = "415--421",

note = "Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN ; Conference date: 12-06-1996 Through 14-06-1996",

}

TY - CONF

T1 - Fault-tolerant multicast with traffic-balancing in hypercubes

AU - Shen, Hong

PY - 1996

Y1 - 1996

N2 - Multicast is an important interprocessor communication pattern existing in various parallel application algorithms. This paper proposes a new multicast algorithm for hypercube computers that not only minimizes the number of hops required for delivery of the message and keeps a least possible amount of traffic, but also takes into consideration of balancing traffic among the active processors to maximize the parallelism in communication. Our algorithm has a time complexity of O(nN) for fault-tolerant multicasting in a hyper-cube of N = 2 n processors containing an arbitrary number of faulty processors.

AB - Multicast is an important interprocessor communication pattern existing in various parallel application algorithms. This paper proposes a new multicast algorithm for hypercube computers that not only minimizes the number of hops required for delivery of the message and keeps a least possible amount of traffic, but also takes into consideration of balancing traffic among the active processors to maximize the parallelism in communication. Our algorithm has a time complexity of O(nN) for fault-tolerant multicasting in a hyper-cube of N = 2 n processors containing an arbitrary number of faulty processors.

UR - http://www.scopus.com/inward/record.url?scp=0029701778&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0029701778

SP - 415

EP - 421

T2 - Proceedings of the 1996 2nd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN

Y2 - 12 June 1996 through 14 June 1996

ER -

Fault-tolerant multicast with traffic-balancing in hypercubes

摘要

Conference

其它文件與鏈接

指紋

引用此