Demo Data from SIGIR 2026 / reviewers in the wild / expert
Thorvald Natvig
dblp:17/4406
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2010
—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 |
High-performance computing · 44% Storage systems · 44% 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 |
|---|---|---|---|---|
Storage systems › file systems › distributed file system
parallel file system |
0.1 | 1 | 2010 | Automatic Run-time Parallelization and Transformation of I/O · SC 2010 |
High-performance computing
parallel i/o |
0.1 | 1 | 2010 | Automatic Run-time Parallelization and Transformation of I/O · SC 2010 |
Parallel and multicore computing › parallelization strategies
run-time parallelization |
0.0 | 1 | 2010 | Automatic Run-time Parallelization and Transformation of I/O · SC 2010 |
Methods — techniques the papers use, named apart from their topics
runtime analysis · 0.1MPI-IO · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Run-Time Analysis and Instrumentation for Communication Overlap Potential
Thorvald Natvig, Anne C. Elster |
EuroMPI | 1 |
| 2010 | Automatic Run-time Parallelization and Transformation of I/OabstractAs the size of computational clusters grows, one can expect that I/O will consume an increasing portion of wall-clock time as the problem and node sizes are scaled up, unless parallel I/O is introduced. Unfortunately, using parallel I/O is non-trivial, so few applications developed by individual researchers enjoy its benefits. In this paper, we describe our novel method for analyzing I/O and communication operations at run-time. When nodes perform I/O or communication operations, our technique protects the memory associated with the requests from the application. Subsequent operations are analyzed for overlap between communication and I/O operations. When found, the I/O operation is automatically transformed, by our injected library, from an individual operation to a collective and shared MPI I/O operation. This allows users to benefit from parallel file systems without redesigning or recompiling their applications, and we demonstrate speedup for common usage patterns. Thorvald Natvig, Anne C. Elster, Jan Christian Meyer |
SC | 1 |