Demo Data from SIGIR 2026 / reviewers in the wild / expert
Bong-Rad Choi
dblp:00/1594
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author
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 · 87% Parallel and multicore computing · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
clock synchronization |
0.0 | 1 | 1990 | An Improved Hardware Implementation of the Fault-Tolerant Clock Synchronization Algorithm for Large Multiprocessor Systems · IEEE Trans. Computers 1990 |
Distributed systems › clock synchronization
fault-tolerant clock synchronization |
0.0 | 1 | 1990 | An Improved Hardware Implementation of the Fault-Tolerant Clock Synchronization Algorithm for Large Multiprocessor Systems · IEEE Trans. Computers 1990 |
Parallel and multicore computing
multiprocessor system |
0.0 | 1 | 1990 | An Improved Hardware Implementation of the Fault-Tolerant Clock Synchronization Algorithm for Large Multiprocessor Systems · IEEE Trans. Computers 1990 |
Methods — techniques the papers use, named apart from their topics
threshold generation logic · 0.0counting encoder · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | An Improved Hardware Implementation of the Fault-Tolerant Clock Synchronization Algorithm for Large Multiprocessor SystemsabstractAn improved implementation of clock synchronization of multiprocessor systems in the presence of malicious faults is proposed. The proposed hardware implementation for the reference clock selection has a lower gate complexity, smaller time delay, and greater flexibility than the previously published implementation. The improvement is achieved by replacing the sorter with a counting encoder and comparators and by introducing threshold generation logic with programmable registers. The scheme has a gate complexity of O(n) and a delay of O(log n), where n is the total number of inputs to a particular clock, and is programmable for different values of n and m, the maximum number of faults.> Bong-Rad Choi, Myunghwan Kim 0001 |
IEEE Trans. Computers | 1 |