Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks

Authors:
Andreas Döring;Gunther Lustig
Affiliations:
-;-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 8
Cited 0

Ariadne—an adaptive router for fault-tolerant multicomputers

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori

IEEE Transactions on Parallel and Distributed Systems
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors

IEEE Transactions on Parallel and Distributed Systems
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers

IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Programming and Implementation of Reconfigurable Routers

FPL '98 Proceedings of the 8th International Workshop on Field-Programmable Logic and Applications, From FPGAs to Computing Paradigm
Fault-tolerant adaptive routing for two-dimensional meshes

HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture

Quantified Score

Hi-index	0.00

Visualization

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.