跳到主要內容

臺灣博碩士論文加值系統

(98.82.120.188) 您好!臺灣時間:2024/09/15 14:02
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:張至善
研究生(外文):Jyh-Shan Chang
論文名稱:可漸進延伸之扭曲超方體
論文名稱(外文):Incrementally Extensible Twisted Cubes
指導教授:陳少傑陳少傑引用關係
指導教授(外文):Professor Sao-Jie Chen
學位類別:博士
校院名稱:國立臺灣大學
系所名稱:電機工程學研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2001
畢業學年度:89
語文別:英文
論文頁數:101
中文關鍵詞:超方體扭曲超方體單向超方體環型結構可嵌入性
外文關鍵詞:hypercubetwisted cubeuni-directional hypercubepancyclic
相關次數:
  • 被引用被引用:0
  • 點閱點閱:167
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
隨著電腦科技的進步與網際網路(Internet)的成長,將數以千百計之處理器或通訊單元連結在同一個網路的需求正在不斷地增加。對於這樣的一個互連網路而言,網路的拓撲架構(Network Topology)是一個最重要的考量因素,因為網路的拓撲架構決定了這個網路的效能。在相關的參考文獻中,許多不同的網路拓撲架構曾被提出。在這些不同的拓撲架構中,超方體(Hypercube)因其擁有良好的性質,是最有名且最為廣泛探討的一個拓撲架構。
在與超方體相關的參考文獻中,許多不同的變形超方體曾被提出來以改善超方體的性質,其中非常重要的一種稱為「扭曲超方體」(Twisted Cube)。扭曲超方體是經由特定的法則來改變超方體內某些邊(Edge)的連結而得。雖然在某些性質上有改善,但是在原著中,只提出了建構奇數維度(Odd Dimension)扭曲超方體的建構法。這個缺點嚴重地限制了它的應用。
在本論文中,架構於奇數維度的基礎上,我們首先提出建構偶數維度(Even Dimension) 扭曲超方體的建構法則。然後,我們提出一個具有可漸進延伸性質的網路拓撲架構,這個拓撲架構我們稱之為「可漸進延伸之扭曲超方體」(Incrementally Extensible Twisted Cubes, IETQ)。藉由探討IETQ的幾種重要性質,我們證明IETQ繼承了扭曲超方體良好的性質,可是卻沒有扭曲超方體的一些限制。
環型 (Cycle, Ring, or Hamiltonian Cycle) 結構由於其良好的特性,也常使用於互連網路中。而探討環型結構是否可嵌入某特定之網路拓撲架構,一直以來都是研究的重點問題。一個具有可嵌入環型結構的網路 (A Pancyclic Network),被定義為在這個網路內必須可嵌入包含長度由4開始到節點總數之所有的環型。因此,探討環型結構是否可嵌入某特定網路拓撲架構的問題,其實就是探討這個特定網路的拓撲架構是否具有環型結構可嵌入性。
除了扭曲超方體之外,「交錯超方體」 (Crossed Cube) 與「Möbius超方體」也是非常重要的兩個變形超方體,因為除了建構法則不同之外,三者重要的網路性質均十分相近。在本論文中,我們證明這三種超方體的變形均具有環型結構可嵌入性。
超方體之另一個重要的變形是「單向超方體」(Uni-directional Hypercube)。單向超方體是藉由更改在超方體內原本為無向性的邊為有向性而得。在使用光纖的大型互連網路中,由於將線路與傳輸設備加倍的費用極為高昂,因而廣泛使用單向超方體。在本論文中,我們將探討單向超方體幾項在文獻中尚未被探討過的性質。
With the continuing growth of computer technology and the Internet,
the demand for connecting hundreds or thousands processing or communication elements
in a network is increasing rapidly.
Network topology is one of the most crucial factors for interconnection networks
since it determines the performance of a network.
Many different topologies of interconnection networks have been proposed in the literature.
Among these topologies,
hypercube is the most famous and well studied one because of its nice properties.
A few variants have been proposed to enhance hypercube.
One of the most important variants is called twisted cube,
which is derived by changing the connection
of some links of a hypercube according to some specific rules.
Despite of the enhancements, a twisted cube can only be built with an odd number of dimension.
This drawback has seriously limited the applicability of a twisted cube.
In this Dissertation,
based on the odd case of a twisted cube,
we first propose a construction method for the even case of a twisted cube.
Then, a new family of interconnection networks which we call
the Incrementally Extensible Twisted Cube (\ietq) is proposed to eliminate
the limitation of incremental extensibility.
The proposed \ietq\ inherits all the merits but without the limitations owned by a twisted cube.
Several important combinatorial properties of the \ietq\ network
are studied in this Dissertation.
Because of its nice properties,
a ring structure (hamiltonian cycle) is widely used in interconnection networks.
The problem of embedding a ring structure into different topologies of networks
is always an important topic for research.
A pancyclic network is defined to be a network that
contains cycles of all lengths from 4 to
the total number of nodes $N$ in the network.
Therefore, to determine whether a ring can be embedded into a specific topology of network
is to determine if this topology of network is a pancyclic network or not.
A crossed cube can be constructed recursively from lower-dimension crossed cubes.
By joining every vertex of the first crossed cube of dimension $n-1$
to the vertex of the second crossed cube of the same dimension
following a specific designed relation, called ''pair related relation'''',
we can construct a crossed cube of dimension $n$.
Similar to the cases of a crossed cube and a twisted cube,
we can use one 0-M\"obius cube of dimension $n-1$
together with one 1-M\"obius cube of the same dimension
to create a 0-M\"obius cube or 1-M\"obius cube of dimension $n$.
Crossed cube and M\"obius cube together with twisted cube
are the most important three variants of hypercube
as they all have a diameter that is only half of the size
that a hypercube with the same number of nodes has.
Though a hypercube is not a pancyclic network,
we prove in this Dissertation that these three variants of hypercube
are all pancyclic networks by induction.
A \ud\ hypercube ($UQ$) is also one of the most important variants of hypercube.
$UQ$ is derived by replacing the links in a hypercube with simplex \linebreak \ud\ links;
thus, it can be used in a network where the transmission between nodes
is simplex and \ud\ only.
This $UQ$ topology is well adopted especially in large scale interconnection networks
built with optical fiber where double the links and transmission equipments cannot be afforded.
In this Dissertation, we also investigate several important combinatorial properties
of $UQ$ which have never been studied in the literature before.
Cover
Abstract
Contents
List of Tables
List of Figures
List of Algorithms
1 Introduction
1.1 Hypercube
1.2 Definitions and Performance Problems
1.3 Variants of Hypercube
1.4 Organization of this Dissertation
2 Incrementally Extensible Twisted Cubes
2.1 Twisted Cube
2.2 Even Case of a Twisted Cube
2.3 Construction of an IETQn(N)
2.4 Short Roution Path Algorithm
3 Combinatorial Properties of an IETQn(N)
3.1 Properties of an IETQn(N)
3.2 Pancyclic Property
3.3 Properties Comparison with Other Topologies of Networks
4 Pancyclic Property of Crossed Cube, Mobius Cube,and Twisted Cube
4.1 Crossed Cube
4.2 Mobius Cube
4.3 Pancyclic Property of a TQn
5 Combinatorial Properties of a Uni-directional Hypercube
5.1 Basic Properties of a UQn
5.2 Shortest Routing Path Algorithm
5.3 Containers of a UQn
5.4 k-wide Diameter and Fault Diameter
6 Conclusion and Future Work
@ARTICLE{bondy,
JOURNAL = "{\rm J. A. Bondy and U. S. R. Murty,} Graph Theory with Applications",
YEAR = ŕ980;",
MONTH = "New York: North-Holland,"}
@ARTICLE{west,
JOURNAL = "{\rm D. B. West,} Introduction to Graph Theory",
YEAR = 薗6;",
MONTH = "New Jersey: Prentice-Hall,"}
@ARTICLE{haray,
JOURNAL = "{\rm F. Haray,} Graph Theory",
YEAR = ŕ972;",
MONTH = "Massachusetts: Addison-Wesley,"}
@ARTICLE{leighton,
JOURNAL = "{\rm F. T. Leighton,} Introduction to Parallel Algorithms
and Architectures: Arrays, Trees and Hypercubes",
YEAR = 薗2;",
MONTH = "San Mateo: Morgan Kaufmann,"}
@ARTICLE{siegel,
JOURNAL = "{\rm H. J. Siegel,} Interconnection Networks for Large-Scale Parallel Processing",
YEAR = 薗0;",
MONTH = "New York: McGraw-Hill,"}
@ARTICLE{saad,
AUTHOR = "Y. Saad and M. H. Schultz",
TITLE = "{Topological Properties of Hypercubes}",
JOURNAL = "IEEE Trans. Computers",
YEAR = ŕ988;",
VOLUME = ൭, no. 7",
number = "",
PAGES = 蠳--872",
MONTH = "July"}
@ARTICLE{amawy,
AUTHOR = "A. E. Amawy and S. Latifi",
TITLE = "{Properties and Performance of Folded Hypercubes}",
JOURNAL = "IEEE Trans. Parallel and Distributed Systems",
YEAR = 薗1;",
MONTH = "Jan.",
VOLUME = Ŗ, no. 1",
NUMBER = "",
PAGES = ൧--42"}
@ARTICLE{efe,
AUTHOR = "K. Efe",
TITLE = "{A Variation on the Hypercube with Lower Diameter}",
JOURNAL = "IEEE Trans. Computers",
YEAR = 薗1;",
MONTH = "Nov.",
VOLUME = ൰, no. 11",
NUMBER = ൓",
PAGES = ൕ12;--1316"}
@ARTICLE{katseff,
AUTHOR = "H. P. Katseff",
TITLE = "{Incomplete Hypercube}",
JOURNAL = "IEEE Trans. Computers",
YEAR = ŕ988;",
MONTH = "May",
VOLUME = ൭, no. 5",
NUMBER = "",
PAGES = 蜬--607"}
@ARTICLE{sen,
AUTHOR = "A. Sen",
TITLE = "{Supercube: An Optimally Fault Tolerant Network Architecture}",
JOURNAL = "Acta Informatica",
YEAR = ŕ989;",
MONTH = "",
VOLUME = Ŗ6;",
NUMBER = "",
PAGES = 螵--748"}
@ARTICLE{sur,
AUTHOR = "S. Sur and P. K. Srimani",
TITLE = "{IEH graphs: A novel generalization of hypercube graphs}",
JOURNAL = "Acta Informatica",
YEAR = 薗5;",
MONTH = "",
VOLUME = ൨",
NUMBER = "",
PAGES = 蜥--609"}
@ARTICLE{chang-00,
AUTHOR = "H. Y. Chang and R. J. Chen",
TITLE = "{Incrementally Extensible Folded Hypercube Graphs}",
JOURNAL = "J. Information Science and Engineering",
YEAR = Ŗ000;",
MONTH = "",
VOLUME = ൘",
NUMBER = "",
PAGES = 藳-300"}
@ARTICLE{abraham,
AUTHOR = "S. Abraham and K. Padmanabhan",
TITLE = "{The Twisted Cube Topology for Multiprocessors: A Study in Network Asymmetry}",
JOURNAL = "J. Parallel and Distributed Computing",
YEAR = 薗1;",
MONTH = "",
VOLUME = ൕ",
NUMBER = "",
PAGES = 蔸--110"}
@ARTICLE{chang-99,
AUTHOR = "C. P. Chang and J. N. Wang and L. H. Hsu",
TITLE = "{Topological Properties of Twisted Cube}",
JOURNAL = "Information Sciences",
YEAR = 薗9;",
MONTH = "",
VOLUME = 蕁",
NUMBER = "",
PAGES = 蕣--167"}
@ARTICLE{wu,
AUTHOR = "A. Y. Wu",
TITLE = "{Embedding of tree networks into hypercube}",
JOURNAL = "J. Parallel and Distributed Computing",
YEAR = ŕ985;",
MONTH = "",
VOLUME = Ŗ",
NUMBER = "",
PAGES = 薾--249"}
@ARTICLE{sengupta,
AUTHOR = "A. Sengupta",
TITLE = "{On Ring Embedding in Hypercubes with Faulty Nodes and Links}",
JOURNAL = "Information Processing Letters",
YEAR = 薗8;",
MONTH = "",
VOLUME = ඌ",
NUMBER = "",
PAGES = 薟--214"}
@ARTICLE{pradhan,
AUTHOR = "D. K. Pradhan",
TITLE = "{Dynamically Restructurable Fault-Tolerant Processor Network Architecture}",
JOURNAL = "IEEE Trans. Computers",
YEAR = ŕ985;",
MONTH = "May",
VOLUME = "C-34, no. 5",
NUMBER = "",
PAGES = 蚂--447"}
@ARTICLE{jwo-99-uq,
AUTHOR = "J. S. Jwo and T. C. Tuan",
TITLE = "{On Container Length and Connectivity in Unidirectional Hypercubes}",
JOURNAL = "Networks",
YEAR = 薗9;",
MONTH = "",
VOLUME = ൨",
NUMBER = "",
PAGES = 蘃--317"}
@ARTICLE{chern-97-uq,
AUTHOR = "S. C. Chern and T. C. Tuan and J. S. Jwo",
TITLE = "{Hamiltonicity, vertex symmetry, and broadcasting of uni-directional hypercubes}",
JOURNAL = "IEE Proc. Computers and Digital Techniques",
YEAR = 薗7;",
MONTH = "May",
VOLUME = 蕠, no. 3",
NUMBER = "",
PAGES = 蕹--173"}
@ARTICLE{day-93-uq,
AUTHOR = "K. Day and A. Tripathi",
TITLE = "{Unidirectional star graphs}",
JOURNAL = "Information Processing Letters",
YEAR = 薗3;",
MONTH = "",
VOLUME = ൵",
NUMBER = "",
PAGES = 蕋--129"}
@ARTICLE{tan-93-uq,
AUTHOR = "S. T. Tan and D. H. C. Du",
TITLE = "{Embedded unidirectional incomplete hypercubes for optical networks}",
JOURNAL = "IEEE Trans. Communications",
YEAR = 薗3;",
MONTH = "Sept.",
VOLUME = ൱, no. 9",
NUMBER = "",
PAGES = 蕐4;--1289"}
@ARTICLE{vetter-93-uq,
AUTHOR = "R. J. Vetter and D. H. C. Du",
TITLE = "{Distributed computing in en environment based on high speed optical networks}",
JOURNAL = "IEEE Trans. Computers",
YEAR = 薗3;",
MONTH = "Feb.",
VOLUME = Ŗ6;, no. 2",
NUMBER = "",
PAGES = Ŝ--18"}
@ARTICLE{hsu,
AUTHOR = "D. F. Hsu",
TITLE = "{On Container Width and Length in Graphs, Groups, and Networks}",
JOURNAL = "IEICE Trans. Fundamentals",
YEAR = 薗4;",
MONTH = "Apr.",
VOLUME = "E77-A, no. 4",
NUMBER = "",
PAGES = 蝬--680"}
@ARTICLE{hamdi,
AUTHOR = "M. Hamdi",
TITLE = "{Topological properties of the directional hypercube}",
JOURNAL = "Information Processing Letters",
YEAR = 薗5;",
MONTH = "",
VOLUME = ൽ",
NUMBER = "",
PAGES = 藥--286"}
@ARTICLE{krishnamoorthy,
AUTHOR = "M. S. Krishnamoorthy and B. Krishnamurthy",
TITLE = "{Fault Diameter of Interconnection Networks}",
JOURNAL = "Computers and Mathematics with Applications",
YEAR = ŕ987;",
MONTH = "",
VOLUME = ൕ",
NUMBER = ř/6",
PAGES = 蜑--582"}
@ARTICLE{latifi,
AUTHOR = "Shahram Latifi",
TITLE = "{Combinatorial Analysis of the Fault-Diameter of the $n$-cube}",
JOURNAL = "IEEE Trans. Computers",
YEAR = 薗3;",
MONTH = "Jan.",
VOLUME = ൲, no. 1",
NUMBER = "",
PAGES = Ŗ7;--33"}
@ARTICLE{efe-92,
AUTHOR = "K. Efe",
TITLE = "{The Crossed Cube Architecture for Parallel Computation}",
JOURNAL = "IEEE Trans. Parallel and Distributed Systems",
YEAR = 薗2;",
MONTH = "Sept.",
VOLUME = ŗ, no. 5",
NUMBER = "",
PAGES = 蛑--524"}
@ARTICLE{kulasinghe,
AUTHOR = "P. D. Kulasinghe and S. Betayeb",
TITLE = "{Embedding Binary Trees into Crossed Cubes}",
JOURNAL = "IEEE Trans. Computers",
YEAR = 薗5;",
MONTH = "July",
VOLUME = ൴, no. 7",
NUMBER = "",
PAGES = 衫--929"}
@ARTICLE{chang-00c,
AUTHOR = "C. P. Chang and T. Y. Sung and L. H. Hsu",
TITLE = "{Edge Congestion and Topological Properties of Crossed Cube}",
JOURNAL = "IEEE Trans. Parallel and Distributed Systems",
YEAR = Ŗ000;",
MONTH = "Jan.",
VOLUME = ൓, no. 1",
NUMBER = "",
PAGES = ඈ--80"}
@ARTICLE{cull,
AUTHOR = "P. Cull and S. M. Larson",
TITLE = "{The M\"obius Cubes}",
JOURNAL = "IEEE Trans. Computers",
YEAR = 薗5;",
MONTH = "May",
VOLUME = ൴, no. 5",
NUMBER = "",
PAGES = 蝗--659"}
@ARTICLE{huang-00m,
AUTHOR = "W. T. Huang and Yen Chu Chuang and J. M. Tan and L. H. Hsu",
TITLE = "{Fault-Free Hamiltonian Cycle in Faulty M\"obius Cubes}",
JOURNAL = "J. Computing and Systems",
YEAR = Ŗ000;",
MONTH = "",
VOLUME = Ř",
NUMBER = "",
PAGES = 蔺--113"}
@ARTICLE{leu,
AUTHOR = "Y. R. Leu and S. Y. Kuo",
TITLE = "{Distributed Fault-Tolerant Ring Embedding and Reconfiguration in Hypercubes}",
JOURNAL = "IEEE Trans. Computers",
YEAR = 薗9;",
MONTH = "Jan.",
VOLUME = Ř8;, no. 1",
NUMBER = "",
PAGES = Ŝ1;--88"}
@ARTICLE{duh-96,
AUTHOR = "D. R. Duh and G. H. Chen and D. F. Hsu",
TITLE = "{Combinatorial properties of generalized hypercube graphs}",
JOURNAL = "Information Processing Letters",
YEAR = 薗6;",
MONTH = "",
VOLUME = ř7;",
NUMBER = "",
PAGES = ൱--45"}
@ARTICLE{hsieh,
AUTHOR = "S. Y. Hsieh and G. H. Chen and C. W. Ho",
TITLE = "{Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs}",
JOURNAL = "IEEE Trans. Parallel and Distributed Systems",
YEAR = 薗9;",
MONTH = "Mar.",
VOLUME = ൒, no. 3",
NUMBER = "",
PAGES = 薯--237"}
@ARTICLE{day,
AUTHOR = "K. Day and A. E. AI-Ayyoub",
TITLE = "{Fault Diameter of $k$-ary $n$-cube Networks}",
JOURNAL = "IEEE Trans. Parallel and Distributed Systems",
YEAR = 薗7;",
MONTH = "Sept.",
VOLUME = Ŝ, no. 9",
NUMBER = ŝ",
PAGES = 街--907"}
@ARTICLE{bhuyan,
AUTHOR = "L. N. Bhuyan and D. P. Agrawal",
TITLE = "{Generalized Hypercube and Hyperbus Structures for a Computer Network}",
JOURNAL = "IEEE Trans. Computers",
YEAR = ŕ984;",
MONTH = "Apr.",
VOLUME = "C--33, no. 4",
NUMBER = "",
PAGES = 蘓--333"}
@ARTICLE{cull-95-tq,
AUTHOR = "P. Cull and S. M. Larson",
TITLE = "{On generalized twisted cubes}",
JOURNAL = "Information Processing Letters",
YEAR = 薗5;",
MONTH = "",
VOLUME = ř5;",
NUMBER = "",
PAGES = ൽ--55"}
@ARTICLE{chen-94-wk,
AUTHOR = "G. H. Chen and D. R. Dhu",
TITLE = "{Topological properties communication and computation on WK-recursive networks}",
JOURNAL = "Networks",
YEAR = 薗4;",
MONTH = "",
VOLUME = Ŗ4;, no. 6",
NUMBER = "",
PAGES = 藿--317"}
@ARTICLE{dhu-94-wk,
AUTHOR = "D. R. Dhu and G. H. Chen",
TITLE = "{Topological properties of WK-recursive networks}",
JOURNAL = "J. Parallel and Distributed Computing",
YEAR = 薗4;",
MONTH = "",
VOLUME = Ŗ3;, no. 3",
NUMBER = "",
PAGES = 蚤--474"}
@ARTICLE{su-98-wk,
AUTHOR = "M. Y. Su and G. H. Chen and D. R. Dhu",
TITLE = "{Topological Properties of Incomplete WK-Recursive Networks}",
JOURNAL = "Networks",
YEAR = 薗8;",
MONTH = "",
VOLUME = ൨, no. 1",
NUMBER = "",
PAGES = Ŗ3;--45"}
@ARTICLE{su-97-wk,
AUTHOR = "M. Y. Su and G. H. Chen and D. R. Dhu",
TITLE = "{A Shortest-Path Routing Algorithm for Incomplete WK-Recursive Networks}",
JOURNAL = "IEEE Trans. Parallel and Distributed Systems",
YEAR = 薗7;",
MONTH = "Apr.",
VOLUME = Ŝ, no. 4",
NUMBER = "",
PAGES = 蘿--379"}
@ARTICLE{vecchia-88,
AUTHOR = "G. D. Vecchia and C. Sanges",
TITLE = "{A recursively scalable network VLSI implementation}",
JOURNAL = "Future Generation Computer Systems",
YEAR = ŕ988;",
MONTH = "",
VOLUME = Ř, no. 3",
NUMBER = "",
PAGES = 薻--243"}
@ARTICLE{vecchia-89,
AUTHOR = "G. D. Vecchia and C. Sanges",
TITLE = "{An optimized broadcasting technique for WK-recursive topologies}",
JOURNAL = "Future Generation Computer Systems",
YEAR = ŕ989;/90",
MONTH = "",
VOLUME = Ř, no. 3",
NUMBER = "",
PAGES = 蘱--357"}
@ARTICLE{latifi-94-star,
AUTHOR = "S. Latifi and N. Bagherzadeh",
TITLE = "{Incomplete Star: An Incrementally Scalable Networks Based on the Star Graph}",
JOURNAL = "IEEE Trans. Parallel and Distributed Systems",
YEAR = 薗4;",
MONTH = "Jan.",
VOLUME = ř, no. 1",
NUMBER = "",
PAGES = ŝ7;--102"}
@ARTICLE{aleliunas-82,
AUTHOR = "R. Aleliunas and A. L. Rosenberg",
TITLE = "{On Embedding Rectangular Grids in Square Grids}",
JOURNAL = "IEEE Trans. Computers",
YEAR = ŕ982;",
MONTH = "Sept.",
VOLUME = "C--31, no. 9",
NUMBER = "",
PAGES = 衛--913"}
@ARTICLE{rowley,
AUTHOR = "R. A. Rowley and B. Bose",
TITLE = "{Fault-Tolerant Ring Embedding in de Bruijn Networks}",
JOURNAL = "IEEE Trans. Computers",
YEAR = 薗3;",
MONTH = "Dec.",
VOLUME = ൲, no. 12",
NUMBER = "",
PAGES = ŕ480;--1486"}
@ARTICLE{sung-98,
AUTHOR = "T. Y. Sung and C. Y. Lin and Y. C. Chuang and L. H. Hsu",
TITLE = "{Fault tolerant token ring embedding in double loop networks}",
JOURNAL = "Information Processing Letters",
YEAR = 薗8;",
MONTH = "",
VOLUME = ඊ",
NUMBER = "",
PAGES = 薙--207"}
@ARTICLE{tseng-97,
AUTHOR = "Y. C. Tseng and S. H. Chang and J. P. Sheu",
TITLE = "{Fault-tolerant Ring Embedding in a Star Graph with Both Link and Node Failures}",
JOURNAL = "IEEE Trans. Parallel and Distributed Systems",
YEAR = 薗7;",
MONTH = "Dec.",
VOLUME = Ŝ, no. 12",
NUMBER = "",
PAGES = ൓85;--1195"}
@ARTICLE{tseng-96,
AUTHOR = "Y. C. Tseng",
TITLE = "{Embedding a ring in a hypercube with both faulty links and faulty nodes}",
JOURNAL = "Information Processing Letters",
YEAR = 薗6;",
MONTH = "",
VOLUME = ř9;",
NUMBER = "",
PAGES = 薩--222"}
@INPROCEEDINGS{hilbers,
AUTHOR = "P. A. J. Hilbers and M. R. J. Koopman and J. L. A. van de Snepscheut",
TITLE = "The Twisted Cube",
BOOKTITLE = "Proceedings of Parallel Architectures and Languages Europe",
YEAR = ŕ987;",
VOLUME = "",
PAGES = 蕨-159"}
@INPROCEEDINGS{abuelrub,
AUTHOR = "E. Abuelrub and S. Bettayeb",
TITLE = "{Embedding of complete binary trees in twisted hypercubes}",
BOOKTITLE = "Proceedings of Int. Conf. on Computer Applications
in Design, Simulation, and Analysis",
YEAR = 薗3;",
VOLUME = "",
PAGES = ŕ--4"}
@INPROCEEDINGS{huang,
AUTHOR = "W. T. Huang and J. M. Tan and L. H. Hsu",
TITLE = "{Token Ring Embedding in Faulty Twisted Cubes}",
BOOKTITLE = "Proceedings of the Second Int. Conf. on Parallel System",
YEAR = 薗9;",
VOLUME = "",
PAGES = ŕ--10"}
@INPROCEEDINGS{huang-00,
AUTHOR = "W. T. Huang and M. Y. Lin and J. M. Tan and L. H. Hsu",
TITLE = "{Fault-Tolerant Ring Embedding in Faulty Crossed Cubes}",
BOOKTITLE = "Proceeding of World Multiconf. Systems, Cybernetics and Information SCI''2000",
YEAR = Ŗ000;",
VOLUME = "IV",
PAGES = ŝ7;--102"}
@INPROCEEDINGS{sullivan,
AUTHOR = "H. Sullivan and T. R. Bashkow",
TITLE = "{A large scale homogeneous, fully distributed parallel machine}",
BOOKTITLE = "Proceedings of 4th Symposium on Computer Architecture",
YEAR = 薗7;",
VOLUME = ŕ",
PAGES = 蔹--117"}
@INPROCEEDINGS{cull-91,
AUTHOR = "P. Cull and S. M. Larson",
TITLE = "{The M\"obius Cubes}",
BOOKTITLE = "Proceedings of the Sixth Distributed Memory Computing Conf.",
YEAR = 薗1;",
VOLUME = ൴",
PAGES = 螋--702"}
@INPROCEEDINGS{latifi-92,
AUTHOR = "S. Latifi and S. Q. Zheng and N. Bagherzadeh",
TITLE = "{Optimal ring embedding in hypercubes with faulty links}",
BOOKTITLE = "Proceedings of the IEEE Symposium on Fault-Tolerant Computing",
YEAR = 薗2;",
PAGES = 薂--184"}
@INPROCEEDINGS{chou,
AUTHOR = "C. H. Chou and D. H. C. Du",
TITLE = "{Uni-directional hypercubes}",
BOOKTITLE = "Proceedings of Supercomputing",
YEAR = 薗0;",
VOLUME = "",
PAGES = 藎--263"}
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top