High-energy physics analyses often process the same data as physicists refine algorithms and test new ideas. With data increasingly read from remote storage, each iteration is subject to network latency and depends on network bandwidth and shared-storage throughput, which can vary substantially under load. We present uCache (xrd-ucache), a transparent client-side cache implemented as an XRootD client plugin that requires neither server-side deployment nor changes to analysis code. It uses local storage on the analysis machine as a cache layer between the network and memory. The cache stores only the data actually read by an analysis. It can also rebuild cached data into a branch-aligned, recompressed form, eliminating most of the input/output and decompression costs of subsequent passes. We benchmark the cache using the Analysis Grand Challenge top quark pair analysis on public CMS Open Data compressed with zlib and LZMA. Filling the cache adds essentially no overhead compared with a direct read. Subsequent passes are 1.6-8.8 times faster from the byte cache and 2.1-15.7 times faster from the recompressed cache. For a typical analysis, a 1 TB cache suffices for datasets of 10-20 TB. The largest improvements occur when the remote data source is heavily loaded or geographically distant.
Computational solid-state drives (CompSSDs) are evolving into intelligent storage solutions that integrate near-data computing architectures to achieve computation-storage convergence. They can reduce the overhead of data migration and then accelerate the execution of data-centric workloads through in-situ processing....
Xin-Yue Xun, Jiao-Jiao Wu, Zhi-Bing Sha et al.· ACM Transactions on Storage· 0 citations
Bonfire is a mechanism for accelerating cache warmup based on detailed analysis of block-level data-center traces that provides insights into heuristics for warmup as well as the potential for efficient mechanisms.
Yi-Ying Zhang, Gokul Soundararajan, M. Storer et al.· 0 citations
This model reveals one key opportunity: dividing a restore request proportionally between the storage path and the GPU can improve inference performance while still meeting SLOs, and reduces the KV-cache storage stack to a performance model based on per-tier capacity, per-tier and interconnect bandwidth, and GPU arithm...
The challenges of the restoration-recomputation trade-off are investigated and its impact on inference performance when left unaddressed, and an I/O-aware KV-cache management policy is presented that dynamically navigates this trade-off.
Amirhossein Najafizadeh, Vasily Tarasov, Alex Merenstein et al.· Proceedings of the 18th ACM...· 1 citation
Red-ONION is presented, a high-speed disk-to-disk transfer system that connects research facilities, on campus and beyond, to a computing center, and the end-to-end optimizations across the transfer software, the operating system, and the storage that this requires are described.
Keichi Takahashi, Hiroaki Kataoka, Takeo Hosomi et al.· 0 citations
It is found that hardware offload is not a universal replacement for CPU compression, and compression should be scheduled dynamically: route blocks by codec, operation, size, and accelerator load; cap per-device sub-mission concurrency; and fall back to software when offload is unsupported or saturated.
Yi Jiang, Antonio Boffa, Hamish Nicholson et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.