ClusterBench is presented, a framework for cluster-wide continuous benchmarking that ships with a benchmark collection targeting each component: CPU, GPU, memory, interconnect, and I/O, and collects data across space and time.
Abstract
Data centers need tooling that validates an entire installation rather than individual nodes, at acceptance and at regular intervals thereafter. This requires dispatching identical benchmarks to every node in a single submission, and therefore cluster-aware scheduling. This paper presents ClusterBench, a framework for cluster-wide continuous benchmarking. It ships with a benchmark collection targeting each component: CPU, GPU, memory, interconnect, and I/O. Because measurements are repeated throughout the cluster's lifetime, ClusterBench collects data across space and time. Comparison against earlier runs detects performance regressions introduced by software changes, such as kernel updates or new library versions. The measurements also form a dataset for research on hardware variability. On the NHR@FAU clusters Helma, Alex, and Fritz, variation within a single component stays within 1%. Variation across specimens reaches 5%, despite nodes identical by specification. Correlating performance with power draw, frequency, and temperature shows that this relationship differs between air- and liquid-cooled nodes.
Parallel performance depends not only on programming language and runtime design, but also on how the dominant execution bottleneck changes as parallelism increases. We present a controlled cross-language study of Rust, Julia, Haskell, and Python using Merge Sort, Closest Pair of Points, and Numerical Sum in a multicor...
Muhammad Hassam Aslam Khan, Daniel Stapleton, Medha Kulkarni et al.· Software· 0 citations
Messaging experiments on high-performance computing clusters must coordinate services, clients, and measurement within scheduler allocations. We present HPC-MQBench, a Slurm-orchestrated benchmark that links resumable experiment control to record checks, delivery accounting, and qualification before rate ranking. Its K...
Task-based HPC runtimes are typically tuned under a performance-first requirement with the assumption that the fastest configuration requires all available cores. This paper asks whether that assumption holds, and whether high performance can be achieved with fewer resources. We study this question using SWITCHES, a ta...
Hui-Min Zhang, Andreas Diavastos· Workshop Proceedings of the...· 0 citations
A benchmarking study of Python-Rust interoperability reveals that the Rust enhanced versions systematically execute faster than pure Pythoncode- up to three times faster in some cases.
S. Singh, R.pradeep Raj· International Journal For Mu...· 0 citations
The IO500 benchmark provides a common basis for evaluating high-performance computing (HPC) storage systems, while its growing submission repository also offers an opportunity to study performance behavior across systems and time. This work presents a repository-scale characterization of 294 post-reset IO500 submission...
Aasish Kumar Sharma, A. Ghazanfar, Sepehr Mahmoodianhamedani et al.· 0 citations
This work offers data-driven validation of SPEC's methodology, showing that the fidelity gap is not a flaw but a quantifiable consequence of enforcing portability, determinism, and CPU-centric measurement.
Doa'a Al-Otoom, M. Madhav· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.