Demo Data from EDBT 2026 / reviewers in the wild / expert
Tom Arsenlis
dblp:33/1526
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2
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 · 62% Parallel and multicore computing · 38% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › parallel computing
parallel scientific computing |
0.0 | 1 | 2004 | Scalable Line Dynamics in ParaDiS · SC 2004 |
High-performance computing
scientific computing systems |
0.0 | 1 | 2004 | Scalable Line Dynamics in ParaDiS · SC 2004 |
High-performance computing › supercomputing
bluegene/l |
0.0 | 1 | 2004 | Scalable Line Dynamics in ParaDiS · SC 2004 |
High-performance computing
supercomputing |
0.0 | 1 | 2004 | Scalable Line Dynamics in ParaDiS · SC 2004 |
Methods — techniques the papers use, named apart from their topics
parallel simulation · 0.0dislocation line tracing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Load balancing n-body simulations with highly non-uniform densityabstractN-body methods simulate the evolution of systems of particles (or bodies). They are critical for scientific research in fields as diverse as molecular dynamics, astrophysics, and material science. Most load balancing techniques for N-body methods use particle count to approximate computational work. This approximation is inaccurate, especially for systems with high density variation, because work in an N-body simulation is proportional to the particle density, not the particle count. In this paper, we demonstrate that existing techniques do not perform well at scale when particle density is highly non-uniform, and we propose a load balance technique that efficiently assigns load in terms of interactions instead of particles. We use adaptive sampling to create an even work distribution more amenable to partitioning, and to reduce partitioning overhead. We implement and evaluate our approach on a Barnes-Hut algorithm and a large-scale dislocation dynamics application, ParaDiS. Our method achieves up to 26% improvement in overall performance of Barnes-Hut and 18% in ParaDiS. Olga Pearce, Todd Gamblin, Bronis R. de Supinski, Tom Arsenlis, Nancy M. Amato |
ICS | 4 |
| 2004 | Scalable Line Dynamics in ParaDiSabstractWe describe an innovative highly parallel application program, ParaDiS, which computes the plastic strength of materials by tracing the evolution of dislocation lines over time. We discuss the issues of scaling the code to tens of thousands of processors, and present early scaling results of the code run on a prototype of the BlueGene/L supercomputer being developed by IBM in partnership with the US DOE’s ASC program. Vasily V. Bulatov, Jeff Fier, Masato Hiratani, Gregg Hommes, Tim Pierce, Meijie Tang, Moono Rhee, Kim Yates, Tom Arsenlis |
SC | 10 |