Demo Data from VLDB 2026 / reviewers in the wild / expert
Michal Soch
dblp:89/317
· DBLP profile ↗
5ranked-venue papers
5as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 3 first-authorTheory of computation · 2 · 2 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 |
High-performance computing · 30% Distributed systems · 30% Parallel and multicore computing · 30% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing
collective communication |
0.0 | 1 | 1999 | Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes · IEEE Trans. Parallel Distributed Syst. 1999 |
Distributed systems
gossip protocols |
0.0 | 1 | 1999 | Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes · IEEE Trans. Parallel Distributed Syst. 1999 |
Parallel and multicore computing › task scheduling
time-optimal scheduling |
0.0 | 1 | 1999 | Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes · IEEE Trans. Parallel Distributed Syst. 1999 |
Interconnection networks and networks-on-chip › network topology › static interconnection networks
mesh and torus networks |
0.0 | 1 | 1999 | Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and Meshes · IEEE Trans. Parallel Distributed Syst. 1999 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | Time-Optimal Gossip of Large Packets in Noncombining 2D Tori and MeshesabstractThe main results of this paper are algorithms for time-optimal gossip of large packets in noncombining full-duplex all-port 2-D tori and meshes of any size m/spl times/n. The gossip algorithms define the structure of broadcast trees and lock-step scheduling schemes for packets that make the broadcast trees time-are-disjoint. The gossip algorithm for tori is also buffer-optimal-it requires routers with auxiliary buffers for at most three packets. The gossip algorithm for meshes requires routers with auxiliary buffers for O(m+n) packets. Michal Soch, Pavel Tvrdík |
IEEE Trans. Parallel Distributed Syst. | 1 |
| 1998 | Time-Optimal Gossip in Noncombining 2-D Tori with Constant Buffers
Michal Soch, Pavel Tvrdík |
Euro-Par | 1 |
| 1998 | Time-optimal gossip in noncombining 3-D tori
Michal Soch, Pavel Tvrdík |
SIROCCO | 1 |
| 1997 | Optimal Gossip in Store-and-Forward Noncombining 2-D Tori
Michal Soch, Pavel Tvrdík |
Euro-Par | 1 |
| 1997 | Optimal gossip in noncombining 2D-meshes
Michal Soch, Pavel Tvrdík |
SIROCCO | 1 |