Abstract
Extensive research and studies have shown that the hypercube network is one of the most widely used techniques to build high performance parallel computers and it offers strong hierarchical structure with high symmetry properties. However, the performance of hypercube networks is mainly dependent on the link consistency between the nodes. Due to unexpected links failure and low connectivity, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents a new stored and forward one-bit round robin routing algorithm that can efficiently send and receive messages between the nodes even in the presence of faulty links. In addition, we also examine and simulate the data throughput and hot spot properties of a hypercube network. Simulation results demonstrate that the proposed routing algorithm improves the overall performance of hypercube network by means of load-scalability that not only reduces the average waiting time per output queue but also increases the total data throughput even in the presence of faulty nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
K. Shin and P. Ramanathan, “Clock synchronization of a large multiprocessor system in the presence of malicious faults,” IEEE Trans. Computers, vol. 36, Issue. 1, pp. 2–12, Jan. 1987.
D. Peleg and J. Ullman, “An optimal synchronizer for the hypercube,” Soc. Indust. Appl. Math., vol. 18, Issue. 4, pp. 740–747, Aug. 1989.
M. Harrington, “New method for synchronizing distributed systems in the presence of faults,” MSEE thesis, Dep. Elec. Eng., Univ. of Washington, March. 1991.
M. Harrington and A. Somani, “Synchronizing hypercube networks in the presence of faults,” IEEE Trans. on Computers Archive, vol. 43, Issue 10, pp. 1175 – 1183, 1994.
M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Cambridge University Press, January 31, 2005.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 2000.
T. Leighton, B. Maggs, A. Richa, “Fast algorithms for finding O (Congestion + Dilation) packet routing schedules,” Combinatorica, vol. 19, pp. 375–401, 1999.
F. Meyer and V. Äocking, “Shortest-path routing in arbitrary networks,” Journal of Algorithms, vol. 31, pp. 105–131, 1999.
N. Alon, F. Chung, R. Graham, “Routing permutations on graphs via matching,” SIAM Journal on Discrete Mathematics, vol. 7, pp. 513–530, 1994.
I. Ben-Aroya, D. Chinn, A. Schuster, “A lower bound for nearly minimal adaptive and hot potato algorithms,” Algorithmica, vol. 21, pp. 347–376, 1998.
C. Busch, M. Herlihy, R. Wattenhofer, “Hard-potato routing,” in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 278–285, 2000.
J. Kim and K. Shin, “Deadlock-free fault-tolerant routing in injured hypercube,” IEEE Trans. on Computers, pp. 1078–1088, September 1993.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this paper
Cite this paper
Rizvi, S.S., Sheikh, A., Riasat, A. (2010). Faulty Links Optimization for Hypercube Networks via Stored and Forward One-Bit Round Robin Routing Algorithm. In: Sobh, T., Elleithy, K., Mahmood, A. (eds) Novel Algorithms and Techniques in Telecommunications and Networking. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3662-9_48
Download citation
DOI: https://doi.org/10.1007/978-90-481-3662-9_48
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3661-2
Online ISBN: 978-90-481-3662-9
eBook Packages: EngineeringEngineering (R0)