Toward optimal broadcast in a star graph using multiple spanning trees

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > journal & Dissertation > Item 987654321/29208

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29208

Title:	Toward optimal broadcast in a star graph using multiple spanning trees
Authors:	Tseng,YC;Sheu,JP
Contributors:	資訊工程研究所
Keywords:	INTERCONNECTION NETWORKS;COMMUNICATION;ALGORITHMS;HYPERCUBES
Date:	1997
Issue Date:	2010-06-29 20:16:24 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	IEEE TRANSACTIONS ON COMPUTERS
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	378	View/Open

社群 sharing