Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ed Karrels

dblp:349/8054 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2023
0009-0001-0341-1337ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

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
Storage systems · 60% Memory systems · 20% High-performance computing · 20%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › cache management › storage caching
burst buffer
0.712023
Fine-grained Policy-driven I/O Sharing for Burst Buffers · SC 2023
Storage systems › storage performance
i/o interference
0.712023
Fine-grained Policy-driven I/O Sharing for Burst Buffers · SC 2023
Storage systems
i/o scheduling
0.712023
Fine-grained Policy-driven I/O Sharing for Burst Buffers · SC 2023
Storage systems › i/o architecture › i/o subsystem
i/o sharing
0.712023
Fine-grained Policy-driven I/O Sharing for Burst Buffers · SC 2023
High-performance computing
parallel i/o
0.712023
Fine-grained Policy-driven I/O Sharing for Burst Buffers · SC 2023

Methods — techniques the papers use, named apart from their topics

statistical token · 0.7fair sharing policy · 0.7
YearPublicationVenuePosition
2023 Fine-grained Policy-driven I/O Sharing for Burst Buffers
abstract
A burst buffer is a common method to bridge the performance gap between the I/O needs of modern supercomputing applications and the performance of the shared file system on large-scale supercomputers. However, existing I/O sharing methods require resource isolation, offline profiling, or repeated execution that significantly limit the utilization and applicability of these systems. Here we present ThemisIO, a policy-driven I/O sharing framework for a remote-shared burst buffer: a dedicated group of I/O nodes, each with a local storage device. ThemisIO preserves high utilization by implementing opportunity fairness so that it can reallocate unused I/O resources to other applications. ThemisIO accurately and efficiently allocates I/O cycles among applications, purely based on real-time I/O behavior without requiring user-supplied information or offline-profiled application characteristics. ThemisIO supports a variety of fair sharing policies, such as user-fair, size-fair, as well as composite policies, e.g., group-then-user-fair. All these features are enabled by its statistical token design. ThemisIO can alter the execution order of incoming I/O requests based on assigned tokens to precisely balance I/O cycles between applications via time slicing, thereby enforcing processing isolation. Experiments using I/O benchmarks show that ThemisIO sustains 13.5--13.7% higher I/O throughput and 19.5--40.4% lower performance variation than existing algorithms. For real applications, ThemisIO significantly reduces the slowdown by 59.1--99.8% caused by I/O interference.
Ed Karrels, Lei Huang 0019, Yuhong Kan, Ishank Arora, Yinzhi Wang, Daniel S. Katz, William Gropp, Zhao Zhang 0007
SC1