Sree Kodak

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

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

Systems, architecture and hardware · 1 · 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
Cloud and datacenter computing · 91% Performance modeling and evaluation · 9%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.512021
Take it to the limit: peak prediction-driven resource overcommitment in datacenters · EuroSys 2021
Cloud and datacenter computing › cluster resource management and scheduling
cluster scheduling
0.512021
Take it to the limit: peak prediction-driven resource overcommitment in datacenters · EuroSys 2021
Cloud and datacenter computing › resource management › datacenter memory management
memory oversubscription
0.512021
Take it to the limit: peak prediction-driven resource overcommitment in datacenters · EuroSys 2021
Performance modeling and evaluation
workload characterization
0.112021
Take it to the limit: peak prediction-driven resource overcommitment in datacenters · EuroSys 2021

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

resource usage prediction · 0.5peak oracle · 0.5
YearPublicationVenuePosition
2021 Take it to the limit: peak prediction-driven resource overcommitment in datacenters
abstract
To increase utilization, datacenter schedulers often overcommit resources where the sum of resources allocated to the tasks on a machine exceeds its physical capacity. Setting the right level of overcommitment is a challenging problem: low overcommitment leads to wasted resources, while high overcommitment leads to task performance degradation. In this paper, we take a first principles approach to designing and evaluating overcommit policies by asking a basic question: assuming complete knowledge of each task's future resource usage, what is the safest overcommit policy that yields the highest utilization? We call this policy the peak oracle. We then devise practical overcommit policies that mimic this peak oracle by predicting future machine resource usage. We simulate our overcommit policies using the recently-released Google cluster trace, and show that they result in higher utilization and less overcommit errors than policies based on per-task allocations. We also deploy these policies to machines inside Google's datacenters serving its internal production workload. We show that our overcommit policies increase these machines' usable CPU capacity by 10-16% compared to no overcommitment.
Noman Bashir, Krzysztof Rzadca, David Irwin 0001, Sree Kodak, Rohit Jnagal
EuroSys5