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

Peter Vondras

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

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

Computer networks · 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
Cloud and datacenter computing · 56% Storage systems · 28% Distributed systems · 17%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.412019
Reducing tail latency using duplication: a multi-layered approach · CoNEXT 2019
Storage systems
data redundancy
0.412019
Reducing tail latency using duplication: a multi-layered approach · CoNEXT 2019
Cloud and datacenter computing › quality of service
tail latency
0.412019
Reducing tail latency using duplication: a multi-layered approach · CoNEXT 2019
Distributed systems
fault tolerance
0.112019
Reducing tail latency using duplication: a multi-layered approach · CoNEXT 2019
Distributed systems › distributed data processing
straggler mitigation
0.112019
Reducing tail latency using duplication: a multi-layered approach · CoNEXT 2019

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

scheduling · 0.4prototype implementation · 0.4
YearPublicationVenuePosition
2019 Reducing tail latency using duplication: a multi-layered approach
abstract
Duplication can be a powerful strategy for overcoming stragglers in cloud services, but is often used conservatively because of the risk of overloading the system. We call for making duplication a first-class concept in cloud systems, and make two contributions in this regard. First, we present duplicate-aware scheduling or DAS, an aggressive duplication policy that duplicates every job, but keeps the system safe by providing suitable support (prioritization and purging) at multiple layers of the cloud system. Second, we present the D-Stage abstraction, which supports DAS and other duplication policies across diverse layers of a cloud system (e.g., network, storage, etc.). The D-Stage abstraction decouples the duplication policy from the mechanism, and facilitates working with legacy layers of a system. Using this abstraction, we evaluate the benefits of DAS for two data parallel applications (HDFS, an in-memory workload generator) and a network function (Snort-based IDS cluster). Our experiments on the public cloud and Emulab show that DAS is safe to use, and the tail latency improvement holds across a wide range of workloads.
Hafiz Mohsin Bashir, Abdullah Bin Faisal, Muhammad Asim Jamshed, Peter Vondras, Ali Musa Iftikhar, Ihsan Ayyub Qazi, Fahad R. Dogar
CoNEXT4