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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chrisma Pakha

dblp:207/1877 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Software engineering, systems software and programming languages · 1

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 · 44% Cloud and datacenter computing · 44% Parallel and multicore computing · 13%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › i/o › i/o subsystem
i/o scheduling
0.312017
MittOS: Supporting Millisecond Tail Tolerance with Fast Rejecting SLO-Aware OS Interface · SOSP 2017
Storage systems › i/o architecture › i/o subsystem
i/o stack
0.312017
MittOS: Supporting Millisecond Tail Tolerance with Fast Rejecting SLO-Aware OS Interface · SOSP 2017
Cloud and datacenter computing › quality of service
tail latency
0.312017
MittOS: Supporting Millisecond Tail Tolerance with Fast Rejecting SLO-Aware OS Interface · SOSP 2017
Parallel and multicore computing › data parallelism
data-parallel applications
0.112017
MittOS: Supporting Millisecond Tail Tolerance with Fast Rejecting SLO-Aware OS Interface · SOSP 2017

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

fast rejection · 0.6SLO prediction · 0.6
YearPublicationVenuePosition
2017 MittOS: Supporting Millisecond Tail Tolerance with Fast Rejecting SLO-Aware OS Interface
abstract
MittOS provides operating system support to cut millisecond-level tail latencies for data-parallel applications. In MittOS, we advocate a new principle that operating system should quickly reject IOs that cannot be promptly served. To achieve this, MittOS exposes a fast rejecting SLO-aware interface wherein applications can provide their SLOs (e.g., IO deadlines). If MittOS predicts that the IO SLOs cannot be met, MittOS will promptly return EBUSY signal, allowing the application to failover (retry) to another less-busy node without waiting. We build MittOS within the storage stack (disk, SSD, and OS cache managements), but the principle is extensible to CPU and runtime memory managements as well. MittOS' no-wait approach helps reduce IO completion time up to 35% compared to wait-then-speculate approaches.
Mingzhe Hao, Huaicheng Li, Michael Hao Tong, Chrisma Pakha, Riza O. Suminto, Cesar A. Stuardo, Andrew A. Chien, Haryadi S. Gunawi
SOSP4