On the Embedding of the De Bruijn Graphs
碩士 === 國立臺灣大學 === 資訊工程學系 === 86 === MICA是一種可以改變網路拓樸組態的平行架構。在本篇論文中，我們將以 一種叫做bounded graph contraction的圖論觀念為工具來探討平行網路 拓樸嵌入到MICA架構的問題。首先，我們找出了一些著名平行架構的 bounded contraction；接著，我們將證明de Bruijn圖的bounded contraction之下界（lower bound）為O...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/60824466673856429965 |
| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學系 === 86 === MICA是一種可以改變網路拓樸組態的平行架構。在本篇論文中，我們將以
一種叫做bounded graph contraction的圖論觀念為工具來探討平行網路
拓樸嵌入到MICA架構的問題。首先，我們找出了一些著名平行架構的
bounded contraction；接著，我們將證明de Bruijn圖的bounded
contraction之下界（lower bound）為Omega(d)。
Lyuu et al have proposed a reconfiguration parallel
architecture MICA. In this thesis, we introduce a graph
theoretical concept called bounded graph contraction to embed
parallel program into MICA and derive bounded contractions of
several well-known parallel network topologies. We also show
the degree of the bounded graph contraction of undirected de
Bruijn graph B(d,D) has a lower bound of Omega(d).
|
|---|