Demo Data from VLDB 2026 / reviewers in the wild / expert
Tyan-Shu Jou
dblp:09/5721
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1992
—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 |
Memory systems · 77% Parallel and multicore computing · 12% Interconnection networks and networks-on-chip · 12% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
cache coherence |
0.0 | 1 | 1992 | A Scalable Snoopy Coherence Scheme on Distributed Shared-Memory Multiprocessors · SC 1992 |
Memory systems › cache coherence › cache coherence protocol
snoopy coherence |
0.0 | 1 | 1992 | A Scalable Snoopy Coherence Scheme on Distributed Shared-Memory Multiprocessors · SC 1992 |
Parallel and multicore computing › multiprocessor system › shared-memory multiprocessor
distributed shared-memory multiprocessor |
0.0 | 1 | 1992 | A Scalable Snoopy Coherence Scheme on Distributed Shared-Memory Multiprocessors · SC 1992 |
Methods — techniques the papers use, named apart from their topics
snoopy protocol · 0.0directory scheme comparison · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | A Scalable Snoopy Coherence Scheme on Distributed Shared-Memory MultiprocessorsabstractThe authors present a scalable snoopy scheme based on a single-hop-connected multiple-bus topology. To reduce the hardware complexity, each processor will snoop on a dynamically changing subset of the buses. The physically-distributed-logically-shared memory model is chosen to let processors take advantage of local memory accesses for private data. The proposed scheme can enjoy fast memory access and can also take advantage of greater scalability. At the same time, the number of transceivers can grow naturally with the number of processors in the system. Comparing this solution with the directory schemes and the traditional snoopy coherent schemes indicates that the performance of the scheme is promising.> Tyan-Shu Jou, Richard J. Enbody |
SC | 1 |