Demo Data from EDBT 2026 / reviewers in the wild / expert
Eric A. Ziegler
dblp:17/1008
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 61% Electronic design automation · 30% Interconnection networks and networks-on-chip · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › fault management
distributed diagnosis algorithm |
0.0 | 1 | 1995 | A Distributed System-Level Diagnosis Algorithm for Arbitrary Network Topologies · IEEE Trans. Computers 1995 |
Distributed systems
fault tolerance |
0.0 | 1 | 1995 | A Distributed System-Level Diagnosis Algorithm for Arbitrary Network Topologies · IEEE Trans. Computers 1995 |
Electronic design automation › hardware verification and test › fault diagnosis
system-level diagnosis |
0.0 | 1 | 1995 | A Distributed System-Level Diagnosis Algorithm for Arbitrary Network Topologies · IEEE Trans. Computers 1995 |
Interconnection networks and networks-on-chip
network topology |
0.0 | 1 | 1995 | A Distributed System-Level Diagnosis Algorithm for Arbitrary Network Topologies · IEEE Trans. Computers 1995 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0periodic testing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | A Distributed System-Level Diagnosis Algorithm for Arbitrary Network TopologiesabstractA distributed algorithm is described for detecting and diagnosing faulty processors in an arbitrary network. Fault free processors perform simple periodic tests on one another; when a fault is detected or a newly repaired processor joins the network, this new information is disseminated in parallel throughout the network. It is formally proven that the algorithm is correct, and it is also shown that the algorithm is optimal in terms of the time required for all of the fault free processors in the network to learn of a new event. Simulation results are given for arbitrary network topologies.> Sampath Rangarajan, Anton T. Dahbura, Eric A. Ziegler |
IEEE Trans. Computers | 3 |