Abstract
This chapter presents a fault-tolerance shortest routing algorithm with PDPE which is based on the priority of permutation cycle elements. By using the priority rule of permutation cycle elements, we get a priority table to help to select a deterministic shortest route. We stimulate three groups of Network-on-Chip (NoC), they are based on different scalable (n, k)-star graph, and we set several different numbers of fault nodes for each NoC. By comparing PDPE algorithm with DFS, Floyd–Warshall, PSV algorithms, the experimental data shows that PDPE algorithm is optimal, and is the most suitable fault-tolerance routing algorithm for NoC based on (n, k)-star graph.
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
Similar content being viewed by others
References
Pirretti M, Link GM, Brooks RR, Vijaykrishnan N, Kandemir M, Irwin MJ (2004) Fault tolerant algorithms for network-on-chip interconnect. In: VLSI, IEEE computer society annual symposium on, p 46. IEEE computer society annual symposium on VLSI: emerging trends in VLSI systems design (ISVLSI’04)
Yeh S-I (2000) Fault-tolerant routing on the star graph with safety vectors. Master’s thesis, Department of Applied Mathematics, National Sun Yat-sen University
Chiang WK, Chen RJ (1995) The (n, k)-star graph: a generalized star graph. Inf Process Lett 56(5):259–264
Chiang WK, Chen RJ (1998) Topological properties of the (n, k)-star graph. Int J Found Comput Sci 9(2):235–248
Hsu HC, Hsieh YL, Tan JM, Hsu LH (2003) Fault hamiltonicity and fault hamiltonian connectivity of the (n, k)-star graphs. Networks 42:189–201
Wang L, Subrammanian S, Latifi S, Srimani PK (2006) Distance distribution of nodes in star graphs, Appl Math Lett 19(8):780–784
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media B.V.
About this paper
Cite this paper
Xing, J., Feng, M. (2012). A Fault-Tolerance Shortest Routing Algorithm with PDPE on (n, k)-Star Graph for NoC. In: He, X., Hua, E., Lin, Y., Liu, X. (eds) Computer, Informatics, Cybernetics and Applications. Lecture Notes in Electrical Engineering, vol 107. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-1839-5_55
Download citation
DOI: https://doi.org/10.1007/978-94-007-1839-5_55
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-1838-8
Online ISBN: 978-94-007-1839-5
eBook Packages: EngineeringEngineering (R0)