Abstract
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice (partial ordered set with supremum and infimum) is used to describe the necessary operation. It turns out that popular algorithms can be handled this way. Using the properties of lattices efficient implementation options can be found.
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.
References
James D. Allen, Patrick T. Gaughan, David E. Schimmel, and Sudhakar Yalamanchili. Ariadne — an adaptive router for fault-tolerant multicomputers. In Proceedings of the 21st Annual International Symposium on Computer Architecture, pages 278–288, Chicago, Illinois, April 18–21, 1994. IEEE Computer Society TCCA and ACM SIGARCH.
[BCF+95] Nanette J. Boden, Danny Cohen, Robert E. Felderman, Alan E. Kulawik, Charles L. Seitz, Jakov N. Seizovic, and Wen-King Su. Myrinet: A gigabit-per-second local-area network. IEEE Micro, 15(1), February 1995.
Chris M. Cunningham and Dimiter R. Avresky. Fault-Tolerant Adaptive Routing for Two-Dimensional Meshes. In Proceedings of the First International Symposium on High-Performance Computer Architecture, pages 122–131, Raleigh, North Carolina, January 1995. IEEE Computer Society.
Ming-Syan Chen and Kang G. Shin. Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers. IEEE Transactions on Parallel and Distributed Systems, 1(2):152–159, April 1990.
Ge-Ming Chiu and Shui-Pan Wu. A Fault-Tolerant Routing Strategy in Hypercube Multicomputers. IEEE Transactions on Computers, 45(2):143–155, February 1996.
A. C. Döring, W. Obelöer, and G. Lustig. Programming and Implementation of Reconfigurable Routers. In Proc. Field Programmable Logic and Applications. 8th International Workshop, FPL’ 98, volume 1482 of Lecture Notes in Computer Science, pages 500–504, 1998.
Andreas C. Döring, Wolfgang Obelöer, Gunther Lustig, and Erik Maehle. A Flexible Approach for a Fault-Tolerant Router. In Proc. Parallel and Distributed Processing-Proceedings of 10 IPPS/SPDP’ 98 Workshops, volume 1388 of Lecture Notes in Computer Science, pages 693–713, 1998.
Shoji Kyuno. An Inductive Algorithm to Construct Finite Lattices. Mathematics of Computation, 33(145):409–421, January 1979.
Ming-Jer Tsai and Sheng-De Wang. A fully adaptive routing algorithm. IEEE Transactions on Parallel and Distributed Systems, 9(2):163–174, February 1998.
Jie Wu. Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors. IEEE Transactions on Parallel and Distributed Systems, 9(4):321–334, April 1998.
Xilinx, Inc. XC4000XV Family Field Programmable Gate Arrays. Data Sheet, May 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Döring, A.C., Lustig, G. (2000). Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_173
Download citation
DOI: https://doi.org/10.1007/3-540-45591-4_173
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67442-9
Online ISBN: 978-3-540-45591-2
eBook Packages: Springer Book Archive