Virtual-Channel-Based Broadcasting Algorithms on the Star Graph Interconnection Network

碩士 === 國立中山大學 === 應用數學研究所 === 86 === A broadcasting algorithm based on the virtual channels can be developed by using the concept of relay trees. In this thesis, we propose four broadcasting algorithms for the star graph and the incomplete star graph. The first one is broadcasting in the...

Full description

Bibliographic Details
Main Authors: Harng Tian-shiang, 韓天祥
Other Authors: Chang-Biau Yang
Format: Others
Language:zh-TW
Published: 1998
Online Access:http://ndltd.ncl.edu.tw/handle/94861670093012184391
id ndltd-TW-086NSYSU507013
record_format oai_dc
spelling ndltd-TW-086NSYSU5070132016-06-29T04:13:30Z http://ndltd.ncl.edu.tw/handle/94861670093012184391 Virtual-Channel-Based Broadcasting Algorithms on the Star Graph Interconnection Network 星狀圖形連結網路之虛擬通道廣播演算法 Harng Tian-shiang 韓天祥 碩士 國立中山大學 應用數學研究所 86 A broadcasting algorithm based on the virtual channels can be developed by using the concept of relay trees. In this thesis, we propose four broadcasting algorithms for the star graph and the incomplete star graph. The first one is broadcasting in the star graph. The second algorithm is broadcasting in the incomplete star graph. Then we consider about message redundancy in broadcasting, and two broadcasting algorithms without message redundancy on the stargraph and the incomplete star graph are proposed. They all requires [(n+1)/2] irtual channels for each physical link. Chang-Biau Yang 楊昌彪 1998 學位論文 ; thesis 0 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立中山大學 === 應用數學研究所 === 86 === A broadcasting algorithm based on the virtual channels can be developed by using the concept of relay trees. In this thesis, we propose four broadcasting algorithms for the star graph and the incomplete star graph. The first one is broadcasting in the star graph. The second algorithm is broadcasting in the incomplete star graph. Then we consider about message redundancy in broadcasting, and two broadcasting algorithms without message redundancy on the stargraph and the incomplete star graph are proposed. They all requires [(n+1)/2] irtual channels for each physical link.
author2 Chang-Biau Yang
author_facet Chang-Biau Yang
Harng Tian-shiang
韓天祥
author Harng Tian-shiang
韓天祥
spellingShingle Harng Tian-shiang
韓天祥
Virtual-Channel-Based Broadcasting Algorithms on the Star Graph Interconnection Network
author_sort Harng Tian-shiang
title Virtual-Channel-Based Broadcasting Algorithms on the Star Graph Interconnection Network
title_short Virtual-Channel-Based Broadcasting Algorithms on the Star Graph Interconnection Network
title_full Virtual-Channel-Based Broadcasting Algorithms on the Star Graph Interconnection Network
title_fullStr Virtual-Channel-Based Broadcasting Algorithms on the Star Graph Interconnection Network
title_full_unstemmed Virtual-Channel-Based Broadcasting Algorithms on the Star Graph Interconnection Network
title_sort virtual-channel-based broadcasting algorithms on the star graph interconnection network
publishDate 1998
url http://ndltd.ncl.edu.tw/handle/94861670093012184391
work_keys_str_mv AT harngtianshiang virtualchannelbasedbroadcastingalgorithmsonthestargraphinterconnectionnetwork
AT hántiānxiáng virtualchannelbasedbroadcastingalgorithmsonthestargraphinterconnectionnetwork
AT harngtianshiang xīngzhuàngtúxíngliánjiéwǎnglùzhīxūnǐtōngdàoguǎngbōyǎnsuànfǎ
AT hántiānxiáng xīngzhuàngtúxíngliánjiéwǎnglùzhīxūnǐtōngdàoguǎngbōyǎnsuànfǎ
_version_ 1718325937774264320