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

Shaokang Zeng

dblp:267/0515 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-0202-9179ORCID · 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 · 44% Processor architecture and microarchitecture · 28% Performance modeling and evaluation · 28%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
resource contention
0.712023
Quantifying Resource Contention of Co-located Workloads with the System-level Entropy · ACM Trans. Archit. Code Optim. 2023
Cloud and datacenter computing › cluster resource management and scheduling
workload colocation
0.712023
Quantifying Resource Contention of Co-located Workloads with the System-level Entropy · ACM Trans. Archit. Code Optim. 2023
Cloud and datacenter computing
quality of service
0.212023
Quantifying Resource Contention of Co-located Workloads with the System-level Entropy · ACM Trans. Archit. Code Optim. 2023
Cloud and datacenter computing › quality of service
tail latency
0.212023
Quantifying Resource Contention of Co-located Workloads with the System-level Entropy · ACM Trans. Archit. Code Optim. 2023

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

system-level entropy · 0.7container isolation · 0.7CPU-affinity binding · 0.7
YearPublicationVenuePosition
2023 Quantifying Resource Contention of Co-located Workloads with the System-level Entropy
abstract
The workload co-location, such as deploying offline analysis workloads with online service workloads on the same node, has become common for modern data centers. Workload co-location deployment improves data center resource utilization significantly. Still, it also introduces resource contention, resulting in the online service’s quality of service fluctuation, which we call performance interference. As the online service is a tail-latency-sensitive workload, the tail-latency metric can reflect the performance interference degree of the co-location workloads at the application level. However, to guide system design and evaluation, quantitatively evaluating the resource contention of the co-located workloads at the system level is also essential. This article proposes a novel metric called System-Level Entropy (SLE). As a system-level metric, SLE can measure quantitatively resource contention of the co-location systems and perform the apples-to-apples comparison between systems. The experimental results show that SLE can accurately reflect the performance interference of workloads and then evaluate the system resource contention. We also demonstrate two case studies of the SLE. We quantify the affinity of different co-location combinations, including three online services and five offline workloads. Furthermore, we evaluate the effects of state-of-the-art isolated mechanisms (the container and the CPU–affinity binding) with these co-location combinations.
Shaokang Zeng, Lei Wang 0004
ACM Trans. Archit. Code Optim.2