All-to-all Broadcast Problems on Cartesian Product Graphs

碩士 === 國立東華大學 === 應用數學系 === 101 === All-to-all communication occurs in many important applications in parallel processing. In this thesis, we study the all-to-all broadcast number(the shortest time needed to complete the all-to-all broadcast) of Cartesian product of graphs under the assumption that:...

Full description

Bibliographic Details
Main Authors: Jen-Chun Lin, 林仁俊
Other Authors: Ta-Wei Kuo
Format: Others
Published: 2013
Online Access:http://ndltd.ncl.edu.tw/handle/36723390071716391784
id ndltd-TW-101NDHU5507019
record_format oai_dc
spelling ndltd-TW-101NDHU55070192015-10-13T22:40:50Z http://ndltd.ncl.edu.tw/handle/36723390071716391784 All-to-all Broadcast Problems on Cartesian Product Graphs 圖形的卡氏積的全傳播問題 Jen-Chun Lin 林仁俊 碩士 國立東華大學 應用數學系 101 All-to-all communication occurs in many important applications in parallel processing. In this thesis, we study the all-to-all broadcast number(the shortest time needed to complete the all-to-all broadcast) of Cartesian product of graphs under the assumption that: each vertex can use all of its links at the same time, and each communication link is half duplex and can carry only one message at a unit of time. We give upper and lower bounds for the all-to-all broadcast number of Cartesian product of graphs and give formulas for the all-to-all broadcast numbers of some classes of graphs, such as the Cartesian product of two cycles, the Cartesian product of a cycle with a complete graph of odd order, the Cartesian product of two complete graphs of odd order, and the hypercube Q2n under this model. Ta-Wei Kuo 郭大衛 2013 學位論文 ; thesis 29
collection NDLTD
format Others
sources NDLTD
description 碩士 === 國立東華大學 === 應用數學系 === 101 === All-to-all communication occurs in many important applications in parallel processing. In this thesis, we study the all-to-all broadcast number(the shortest time needed to complete the all-to-all broadcast) of Cartesian product of graphs under the assumption that: each vertex can use all of its links at the same time, and each communication link is half duplex and can carry only one message at a unit of time. We give upper and lower bounds for the all-to-all broadcast number of Cartesian product of graphs and give formulas for the all-to-all broadcast numbers of some classes of graphs, such as the Cartesian product of two cycles, the Cartesian product of a cycle with a complete graph of odd order, the Cartesian product of two complete graphs of odd order, and the hypercube Q2n under this model.
author2 Ta-Wei Kuo
author_facet Ta-Wei Kuo
Jen-Chun Lin
林仁俊
author Jen-Chun Lin
林仁俊
spellingShingle Jen-Chun Lin
林仁俊
All-to-all Broadcast Problems on Cartesian Product Graphs
author_sort Jen-Chun Lin
title All-to-all Broadcast Problems on Cartesian Product Graphs
title_short All-to-all Broadcast Problems on Cartesian Product Graphs
title_full All-to-all Broadcast Problems on Cartesian Product Graphs
title_fullStr All-to-all Broadcast Problems on Cartesian Product Graphs
title_full_unstemmed All-to-all Broadcast Problems on Cartesian Product Graphs
title_sort all-to-all broadcast problems on cartesian product graphs
publishDate 2013
url http://ndltd.ncl.edu.tw/handle/36723390071716391784
work_keys_str_mv AT jenchunlin alltoallbroadcastproblemsoncartesianproductgraphs
AT línrénjùn alltoallbroadcastproblemsoncartesianproductgraphs
AT jenchunlin túxíngdekǎshìjīdequánchuánbōwèntí
AT línrénjùn túxíngdekǎshìjīdequánchuánbōwèntí
_version_ 1718080249494765568