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

Yushuai Cui

dblp:377/9666 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0009-9413-5187ORCID · reported

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 · 70% Embedded and real-time systems · 30%

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.812024
Component-distinguishable Co-location and Resource Reclamation for High-throughput Computing · ACM Trans. Comput. Syst. 2024
Embedded and real-time systems › real-time scheduling
resource reclaiming
0.812024
Component-distinguishable Co-location and Resource Reclamation for High-throughput Computing · ACM Trans. Comput. Syst. 2024
Cloud and datacenter computing › cluster resource management and scheduling
workload colocation
0.812024
Component-distinguishable Co-location and Resource Reclamation for High-throughput Computing · ACM Trans. Comput. Syst. 2024
Cloud and datacenter computing › quality of service
tail latency
0.212024
Component-distinguishable Co-location and Resource Reclamation for High-throughput Computing · ACM Trans. Comput. Syst. 2024

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

preemption loss evaluation · 0.8multi-level reclamation queue · 0.8component-distinguishable co-location · 0.8
YearPublicationVenuePosition
2024 Component-distinguishable Co-location and Resource Reclamation for High-throughput Computing
abstract
Cloud service providers improve resource utilization by co-locating latency-critical (LC) workloads with best-effort batch (BE) jobs in datacenters. However, they usually treat multi-component LCs as monolithic applications and treat BEs as “second-class citizens” when allocating resources to them. Neglecting the inconsistent interference tolerance abilities of LC components and the inconsistent preemption loss of BE workloads can result in missed co-location opportunities for higher throughput. We present Rhythm , a co-location controller that deploys workloads and reclaims resources rhythmically for maximizing the system throughput while guaranteeing LC service’s tail latency requirement. The key idea is to differentiate the BE throughput launched with each LC component, that is, components with higher interference tolerance can be deployed together with more BE jobs. It also assigns different reclamation priority values to BEs by evaluating their preemption losses into a multi-level reclamation queue. We implement and evaluate Rhythm using workloads in the form of containerized processes and microservices. Experimental results show that it can improve the system throughput by 47.3%, CPU utilization by 38.6%, and memory bandwidth utilization by 45.4% while guaranteeing the tail latency requirement.
Laiping Zhao, Yushuai Cui, Xiaobo Zhou 0003, Tie Qiu 0001, Keqiu Li, Yungang Bao
ACM Trans. Comput. Syst.2