Demo Data from EDBT 2026 / reviewers in the wild / expert
Robert L. Clay
dblp:44/6442
· DBLP profile ↗
1ranked-venue papers
1as 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 · 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 networks
1 paper |
Network performance modeling · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Interconnection networks and networks-on-chip · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network performance modeling
application performance modeling |
0.0 | 1 | 1995 | Distributing a Chemical Process Optimization Application Over a Gigabit Network · SC 1995 |
Mathematical optimization › combinatorial optimization › assignment problem
linear assignment |
0.0 | 1 | 1995 | Distributing a Chemical Process Optimization Application Over a Gigabit Network · SC 1995 |
Mathematical optimization
stochastic optimization |
0.0 | 1 | 1995 | Distributing a Chemical Process Optimization Application Over a Gigabit Network · SC 1995 |
Methods — techniques the papers use, named apart from their topics
trace-driven performance modeling · 0.0stochastic linear assignment · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Distributing a Chemical Process Optimization Application Over a Gigabit NetworkabstractWe evaluate the impact of a gigabit network on the implementation of a distributed chemical process optimization application. The optimization problem is formulated as a stochastic Linear Assignment Problem and was solved using the Thinking Machines CM-2 (SIMD) and the Cray C-90 (vector) computers at PSC, and the Intel iWarp (MIMD) system at CMU, connected by the Gigabit Nectar testbed. We report our experience distributing the application across this heterogeneous set of systems and present measurements that show how the communication requirements of the application depend on the structure of the application. We use detailed traces to build an application performance model that can be used to estimate the elapsed time of the application for different computer system and network combinations. Our results show that the application benefits from the high-speed network, and that the need for high network throughput is increasing as computer systems get faster. We also observed that supporting high burst rates is critical, although structuring the application so that communication is overlapped with computation relaxes the bandwidth requirements. Robert L. Clay, Peter Steenkiste |
SC | 1 |