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

Andreas C. Döring; Gunther Lustig

doi:10.1007/3-540-45591-4_173

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

Andreas C. Döring, Gunther Lustig

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 plementation options can be found.

Originalsprache	Englisch
Titel	IPDPS 2000: Parallel and Distributed Processing
Seitenumfang	10
Band	1800 LNCS
Herausgeber (Verlag)	Springer Verlag
Erscheinungsdatum	01.12.2000
Seiten	1266-1275
ISBN (Print)	978-3-540-67442-9
ISBN (elektronisch)	978-3-540-45591-2
DOIs	https://doi.org/10.1007/3-540-45591-4_173
Publikationsstatus	Veröffentlicht - 01.12.2000
Extern publiziert	Ja
Veranstaltung	15 Workshops Held in Conjunction with the IEEE International Parallel and Distributed Processing Symposium - Cancun, Mexico Dauer: 01.05.2000 → 05.05.2000 Konferenznummer: 96623

Dokumente

10.1007/3-540-45591-4_173

Weitere Links

https://www.scopus.com/pages/publications/13944253509

Zitieren

@inproceedings{ae208d55c3824a3690d8eabd9d8869f4,

title = "Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks",

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 plementation options can be found.",

author = "D{\"o}ring, \{Andreas C.\} and Gunther Lustig",

year = "2000",

month = dec,

day = "1",

doi = "10.1007/3-540-45591-4\_173",

language = "English",

isbn = "978-3-540-67442-9",

volume = "1800 LNCS",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "1266--1275",

booktitle = "IPDPS 2000: Parallel and Distributed Processing",

note = "15 Workshops Held in Conjunction with the IEEE International Parallel and Distributed Processing Symposium , IPDPS 2000 ; Conference date: 01-05-2000 Through 05-05-2000",

}

Döring, AC & Lustig, G 2000, Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks. in IPDPS 2000: Parallel and Distributed Processing. Bd. 1800 LNCS, Lecture Notes in Computer Science, Bd. 1800 LNCS, Springer Verlag, S. 1266-1275, 15 Workshops Held in Conjunction with the IEEE International Parallel and Distributed Processing Symposium , Cancun, Mexico, 01.05.00. https://doi.org/10.1007/3-540-45591-4_173

Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks. / Döring, Andreas C.; Lustig, Gunther.
IPDPS 2000: Parallel and Distributed Processing. Band 1800 LNCS Springer Verlag, 2000. S. 1266-1275 (Lecture Notes in Computer Science; Band 1800 LNCS).

Publikation: Kapitel in Büchern/Berichten/Konferenzbänden › Konferenzbeitrag › Begutachtung

TY - GEN

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

AU - Döring, Andreas C.

AU - Lustig, Gunther

N1 - Conference code: 96623

PY - 2000/12/1

Y1 - 2000/12/1

N2 - 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 plementation options can be found.

AB - 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 plementation options can be found.

UR - https://www.scopus.com/pages/publications/13944253509

U2 - 10.1007/3-540-45591-4_173

DO - 10.1007/3-540-45591-4_173

M3 - Conference contribution

SN - 978-3-540-67442-9

VL - 1800 LNCS

T3 - Lecture Notes in Computer Science

SP - 1266

EP - 1275

BT - IPDPS 2000: Parallel and Distributed Processing

PB - Springer Verlag

T2 - 15 Workshops Held in Conjunction with the IEEE International Parallel and Distributed Processing Symposium

Y2 - 1 May 2000 through 5 May 2000

ER -

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

Abstract

Dokumente

Weitere Links

Fingerprint

Zitieren