Toward optimal broadcast in a star graph using multiple spanning trees

NCU Institutional Repository > 資訊電機學院 > 資訊工程研究所 > 期刊論文 > Item 987654321/29208

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29208

題名:	Toward optimal broadcast in a star graph using multiple spanning trees
作者:	Tseng,YC;Sheu,JP
貢獻者:	資訊工程研究所
關鍵詞:	INTERCONNECTION NETWORKS;COMMUNICATION;ALGORITHMS;HYPERCUBES
日期:	1997
上傳時間:	2010-06-29 20:16:24 (UTC+8)
出版者:	中央大學
摘要:	In a multicomputer network, sending a packet typically incurs two costs: start-up time and transmission time. This work is motivated by the observation that most broadcast algorithms in the literature for the star graph networks only try to minimize one of the costs. Thus, many algorithms, though claimed to be optimal, are only so when one of the costs is negligible. In this paper, we try to optimize both costs simultaneously for four types of broadcast problems: one-to-all or all-to-all broadcasting in an n-star network with either one-port or all-port communication capability. As opposed to earlier solutions, the main technique used in this paper is to coristruct from a source node multiple spanning trees, along each of which one partition of the broadcast message is transmitted.
關聯:	IEEE TRANSACTIONS ON COMPUTERS
顯示於類別:	[資訊工程研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	378	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing