On the All-to-All Personalized Exchange Problem in Chordal Ring Networks
碩士 === 國立交通大學 === 應用數學系所 === 98 === In [5, 7], Masuyama et al. proposed two all-to-all communication algorithms for chordal ring networks of degree 3. The ¯rst algorithm (call it Algorithm A) is an all-to-all personalized exchange algorithm and it is used when there is no fault. The second algorithm...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/59096160213917912586 |
id |
ndltd-TW-098NCTU5507004 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-098NCTU55070042016-04-25T04:27:17Z http://ndltd.ncl.edu.tw/handle/59096160213917912586 On the All-to-All Personalized Exchange Problem in Chordal Ring Networks 弦環式網路之全體對全體私有訊息傳送問題之研究 Tseng, Hui-Fen 曾慧棻 碩士 國立交通大學 應用數學系所 98 In [5, 7], Masuyama et al. proposed two all-to-all communication algorithms for chordal ring networks of degree 3. The ¯rst algorithm (call it Algorithm A) is an all-to-all personalized exchange algorithm and it is used when there is no fault. The second algorithm (call it Algorithm B) is an all-to-all broadcast algorithm and it can tolerate one or two faults. In [5, 7], it has been proven that Algorithm A takes sigma_i=1 to N/2 i time units to fulfill an all-to-all personalized exchange in a chordal ring network CR(N;w), where N is the number of nodes and w is the chord length of the chordal ring network. However, we observe that Algorithm A only utilizes ring-links to fulfill an all-to-all communication and Algorithm B tilizes chordal-links only when there are faults. Since all of the chordal-links are not used in any all-to-all communication when there is no fault, a huge amount of hardware is wasted. In this thesis, we will use chordal-links to facilitate an all-to-all personalized exchange. In particular, we propose an all-to-all personalized exchange algorithm that works for all chordal ring networks. We will show that our algorithm uses less time units to fulfill an all-to-all personalized exchange and hence improves Algorithm A. We also provide an all-to-all personalized exchange algorithm that works only for chordal ring networks with w = 3 and clarify some unclear parts and correct some incorrect parts in Algorithm B. Chen, Chiuyuan 陳秋媛 2010 學位論文 ; thesis 47 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 應用數學系所 === 98 === In [5, 7], Masuyama et al. proposed two all-to-all communication algorithms for chordal ring networks of degree 3. The ¯rst algorithm (call it Algorithm A) is
an all-to-all personalized exchange algorithm and it is used when there is no fault. The second algorithm (call it Algorithm B) is an all-to-all broadcast algorithm and
it can tolerate one or two faults. In [5, 7], it has been proven that Algorithm A takes sigma_i=1 to N/2 i time units to fulfill an all-to-all personalized exchange in a chordal ring network CR(N;w), where N is the number of nodes and w is the chord length of the chordal ring network. However, we observe that Algorithm A only utilizes ring-links to fulfill an all-to-all communication and Algorithm B tilizes chordal-links only when there are faults. Since all of the chordal-links are not used in any all-to-all communication when there is no fault, a huge amount of hardware is wasted. In this thesis, we will use chordal-links to facilitate an all-to-all personalized exchange.
In particular, we propose an all-to-all personalized exchange algorithm that works for all chordal ring networks. We will show that our algorithm uses less time units to fulfill an all-to-all personalized exchange and hence improves Algorithm A. We also provide an all-to-all personalized exchange algorithm that works only for chordal
ring networks with w = 3 and clarify some unclear parts and correct some incorrect parts in Algorithm B.
|
author2 |
Chen, Chiuyuan |
author_facet |
Chen, Chiuyuan Tseng, Hui-Fen 曾慧棻 |
author |
Tseng, Hui-Fen 曾慧棻 |
spellingShingle |
Tseng, Hui-Fen 曾慧棻 On the All-to-All Personalized Exchange Problem in Chordal Ring Networks |
author_sort |
Tseng, Hui-Fen |
title |
On the All-to-All Personalized Exchange Problem in Chordal Ring Networks |
title_short |
On the All-to-All Personalized Exchange Problem in Chordal Ring Networks |
title_full |
On the All-to-All Personalized Exchange Problem in Chordal Ring Networks |
title_fullStr |
On the All-to-All Personalized Exchange Problem in Chordal Ring Networks |
title_full_unstemmed |
On the All-to-All Personalized Exchange Problem in Chordal Ring Networks |
title_sort |
on the all-to-all personalized exchange problem in chordal ring networks |
publishDate |
2010 |
url |
http://ndltd.ncl.edu.tw/handle/59096160213917912586 |
work_keys_str_mv |
AT tsenghuifen onthealltoallpersonalizedexchangeprobleminchordalringnetworks AT cénghuìfēn onthealltoallpersonalizedexchangeprobleminchordalringnetworks AT tsenghuifen xiánhuánshìwǎnglùzhīquántǐduìquántǐsīyǒuxùnxīchuánsòngwèntízhīyánjiū AT cénghuìfēn xiánhuánshìwǎnglùzhīquántǐduìquántǐsīyǒuxùnxīchuánsòngwèntízhīyánjiū |
_version_ |
1718232661021949952 |