Responsive image
博碩士論文 etd-0820101-163307 詳細資訊
Title page for etd-0820101-163307
論文名稱
Title
超立方體上之安全向量繞徑法
Routing with Safety Vectors in the Hypercube
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
42
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2001-07-10
繳交日期
Date of Submission
2001-08-20
關鍵字
Keywords
容錯繞徑、安全向量、超立方體、安全等級
Safety levels, Fault-tolerant routing, Hypercube, Safety vectors
統計
Statistics
本論文已被瀏覽 5674 次,被下載 0
The thesis/dissertation has been browsed 5674 times, has been downloaded 0 times.
中文摘要
本論文將討論超立方體上的可靠通訊方法。在超立方體上,兩個有限全域資訊法,安全等級和安全向量,在容錯領域上已經被論述多次。安全向量中每個節點的資訊傳遞量是O(n2)。為了提高最小繞徑成功的機率,我們決定增加資訊傳遞量,如此我們可以得到更多的資訊以提高繞徑機率。為了達成此目標,我們提出兩個每節點資訊傳遞量為O(n3)的方法,強化安全向量和生成安全向量。我們另外提出了機率安全向量,用以提供額外的繞徑決策。實驗結果和實驗結果分析列於文末。
Abstract
Reliable communication in the hypercube with the safety vectors is discussed in this thesis. In the hypercube, the safety levels and the safety vectors, used to guide fault-tolerant routing, is a kind of limited global information based methods. The transmission cost of the safety vectors is O(n2) for each node. For increasing the probability of optimal routing, we attempt to increase the transmission cost for obtaining more information. We propose two methods with O(n3) transmission cost in each node, the enhanced safety vector and the spanning safety vector, to achieve the goal. We also propose the probabilistic safety vector which provides the probability of optimal routing for each node. Finally, our experiments show that the routing with the enhanced safety vector is more reliable than the safety vectors and the extended safety vectors, which were propose the probabilistic safety vector.
目次 Table of Contents
ABSTRACT
Chapter 1. Introduction
Chapter 2. Preliminaries
2.1 The Hypercube
2.2 Safety Levels
2.3 Safety Vectors
2.4 Extended Safety Vectors
Chapter 3. Fault-Tolerant Routing
3.1 Enhanced Safety Vectors
3.2 Perfect Safety Vectors
3.3 Spanning Safety Vectors
3.4 Probabilistic Safety Vectors
Chapter 4. Experiment Results
Chapter 5. Conclusion31
BIBLIOGRAPHY
參考文獻 References
[1] S. B. Akers and B. Krishnamurthy, "A group-theoretical model for symmetric interconnection networks," IEEE Transactions on Computers, Vol. 38, No. 4,pp. 555-566, Apr. 1989.
[2] L. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structure for a computer netwrk," IEEE Transactions on Computers, Vol. 33, No. 3, pp. 323{333, Mar. 1984.
[3] J. Bruck, R. Cypher, and C. T. Ho, "Fault-tolerant mesh and hypercube architectures with minimal number of spares," IEEE Transactions on Computers, Vol. 42, No. 9, pp. 1089-1104, Sep. 1993.
[4] C. C. Chen and J. Chen, "Vertex-disjoint routings in star graphs," IEEE First International Conference on Algorithms and Architectures ‾r Parallel Processing, Vol. 1, pp. 460-464, 1995.
[5] M. S. Chen and K. G. Shin, "Adaptive fault-tolerant routing in hypercube multicomputers," IEEE Transactions on Computers, Vol. 39, No. 12, pp. 1406-1416, Dec. 1990.
[6] G. M. Chiu and K. S. Chen, "Fault-tolerant routing strategy using routing capability in hypercube multicomputers," Proceeding of the International Conference on Parallel and Distributed System, pp. 396-403, 1996.
[7] L. C. Fan and C. B. Yang, "Routing algorithms on the bus-based hypercube network," In Proc. of National Computer Symposium 1997, Taichung, Taiwan, pp. E-12-E-17, Dec. 1997.
[8] L. Gargano, A. Rescigno, and U. Vaccaro, "Fault{tolerant hypercube broadcasting via information dispersal," Networks, Vol. 23, pp. 271-282, 1993.
[9] A. Ghafoor and P. Sole, "Performance of fault-tolerant diagnostics in the hypercube systems," IEEE Transactions on Computers, Vol. C-38, pp. 1164-1172, Aug. 1989.
[10] J. M. Gordon and Q. F. Stout, "Hypercube message routing in the presence of faults," Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 251-263, Jan. 1988.
[11] N. Graham and F. Harary, "Subcube fault-tolerance in hypercubes," In Information and Computation, Vol. 102, pp. 280-314, July 1993.
[12] N. Graham and F. Harary, "Some small sized spanning subgraphs of a hypercube," Computers Math. Applic., Vol. 34, No. 11, pp. 51-57, 1997.
[13] T. S. Harng and C. B. Yang, "Broadcasting algorithms based upon the virtual channel in the star graph interconnection network," In Proc. of 1999 Workshop on Distributed System Technologies and Applications, pp. 315-323, May 1999.
[14] S. C. Hu and C. B. Yang, "Fault tolerance on star graphs," Journal of Foundations of Computer Science, Vol. 8, No. 2, pp. 127-142, 1997.
[15] H. M. Huang and C. B. Yang, "Broadcasting on uni-directional hypercubes," In Proceedings of International Conference on Parallel and Distributed Systems, Hsinchu, Taiwan, pp. 134-139, Dec. 1994.
[16] Y. Lan, "Fault-tolerant multi-destination routing in hypercube multicomputers," In Proceedings of the 12th International Conference on Distributed Computing Systems, pp. 632-639, June 1992.
[17] Y. Lan, "Adaptive fault-tolerant multicast in hypercube multicomputers,"Journal of Parallel and Distributed Computing, Vol. 23, pp. 80{93, Oct. 1994.
[18] T. C. Lee and J. P. Hayes, "A fault-tolerant communication scheme for hypercube computers," IEEE Transactions on Computers, Vol. 41, No. 10, pp. 1242-1256, Oct. 1992.
[19] J. W. Mao and C. B. Yang, "Pre‾x computation on faulty hypercubes," In Proceedings of 1993 IEEE Region 10 International Conference on Computer, Communication, Control and Power Engineering, Vol. 1, pp. 142-145, Oct. 1993.
[20] J. W. Mao and C. B. Yang, "Shortest path routing and fault-tolerant routing on de Bruijn networks," Networks, Vol. 35, No. 3, pp. 207-215, 2000.
[21] C. S. Raghavendra, P. J. Yang, and S. B. Tien, "Free dimension - an effective approach to achieving fault tolerance in hypercubes," Proc. 22nd Int'l Symp. Fault-Tolerant Computing, pp. 170-177, 1992.
[22] Y. Saad and M. H. Schultz, "Topological properties of hypercubes," IEEE Transactions on Computers, Vol. 37, No. 7, pp. 867{872, July 1988.
[23] S. H. Sheu and C. B. Yang, "Multicast algorithms for hypercube multiprocessors," Journal of Parallel and Distributed Computing, Vol. 61, No. 1, pp. 137-149, Jan. 2001.
[24] J. Wu, "Optimal broadcasting in hypercubes with link faults using limited global information," Vol. 42, pp. 367-380, 1996.
[25] J. Wu, "Unicasting in faulty hypercubes using safety levels," IEEE Transactions on Computers, Vol. 46, No. 2, pp. 241-247, Feb. 1997.
[26] J. Wu, "Adaptive fault-tolerant routing in cube-based multicomputers using safety vectors," IEEE Transactions on Parallel and Distributed Systems, Vol. 9, No. 4, pp. 321-334, Apr. 1998.
[27] J. Wu, F. Gao, Z. Li, and Y. Min, "Optimal fault-tolerant routing in hypercubes using extended safety vectors," Proc. of 7th International Conf. on Parallel and Distributed Systems (ICPADS), pp. 264-271, July 2000.
[28] C. B. Yang, "Bitonic sorting on faulty hypercubes," In Proceedings of the 6th Workshop on Discrete Mathematics and Theory of Computing, pp. 14-21, Nov. 1992.
[29] C. B. Yang and C. C. Liu, "Multicast algorithms on the star graph network," In Proc. of 1997 Workshop on Distributed System Technologies and Applications, pp. 389-398, May 1997.
[30] C. B. Yang and T. H. Liu, "Wormhole routing on the star graph interconnection network," In Proc. of the 4th Australian Theory Symposium, CATS'98, Perth, Australia, pp. 51-65, Feb. 1998.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內校外均不公開 not available
開放時間 Available:
校內 Campus:永不公開 not available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 54.89.24.147
論文開放下載的時間是 校外不公開

Your IP address is 54.89.24.147
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code