Qiuyun Llull

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

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

Systems, architecture and hardware · 2 · 1 first-author

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
2 papers
Cloud and datacenter computing · 63% Parallel and multicore computing · 23% Performance modeling and evaluation · 14%
Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
processor allocation
0.312018
Amdahl's Law in the Datacenter Era: A Market for Fair Processor Allocation · HPCA 2018
Cloud and datacenter computing
resource management
0.312018
Amdahl's Law in the Datacenter Era: A Market for Fair Processor Allocation · HPCA 2018
Algorithmic game theory and mechanism design
fair division
0.312018
Amdahl's Law in the Datacenter Era: A Market for Fair Processor Allocation · HPCA 2018
Algorithmic game theory and mechanism design › market design
market mechanism
0.312018
Amdahl's Law in the Datacenter Era: A Market for Fair Processor Allocation · HPCA 2018
Cloud and datacenter computing
cluster resource management and scheduling
0.312017
Cooper: Task Colocation with Cooperative Games · HPCA 2017
Cloud and datacenter computing › job scheduling
fair scheduling
0.312017
Cooper: Task Colocation with Cooperative Games · HPCA 2017
Performance modeling and evaluation › parallel system performance › speedup modeling
amdahl's law
0.112018
Amdahl's Law in the Datacenter Era: A Market for Fair Processor Allocation · HPCA 2018
Performance modeling and evaluation › parallel system performance
parallel performance modeling
0.112018
Amdahl's Law in the Datacenter Era: A Market for Fair Processor Allocation · HPCA 2018
Algorithmic game theory and mechanism design
cooperative game theory
0.112017
Cooper: Task Colocation with Cooperative Games · HPCA 2017
Algorithmic game theory and mechanism design › matching
stable matching
0.112017
Cooper: Task Colocation with Cooperative Games · HPCA 2017

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

utility function design · 0.7stable matching · 0.6cooperative game theory · 0.6market mechanisms · 0.3market mechanism · 0.3
YearPublicationVenuePosition
2018 Amdahl's Law in the Datacenter Era: A Market for Fair Processor Allocation
abstract
We present a processor allocation framework that uses Amdahl's Law to model parallel performance and a market mechanism to allocate cores. First, we propose the Amdahl utility function and demonstrate its accuracy when modeling performance from processor core allocations. Second, we design a market based on Amdahl utility that optimizes users' bids for processors based on workload parallelizability. The framework uses entitlements to guarantee fairness yet outperforms existing proportional share algorithms.
Seyed Majid Zahedi, Qiuyun Llull, Benjamin C. Lee
HPCA2
2017 Cooper: Task Colocation with Cooperative Games
abstract
Task colocation improves datacenter utilization but introduces resource contention for shared hardware. In this setting, a particular challenge is balancing performance and fairness. We present Cooper, a game-theoretic framework for task colocation that provides fairness while preserving performance. Cooper predicts users' colocation preferences and finds stable matches between them. Its colocations satisfy preferences and encourage strategic users to participate inshared systems. Given Cooper's colocations, users' performance penalties are strongly correlated to their contributions to contention, which is fair according to cooperative game theory. Moreover, its colocations perform within 5% of prior heuristics.
Qiuyun Llull, Songchun Fan, Seyed Majid Zahedi, Benjamin C. Lee
HPCA1