Parties: Qos-aware resource partitioning for multiple interactive services
Multi-tenancy in modern datacenters is currently limited to a single latency-critical,
interactive service, running alongside one or more low-priority, best-effort jobs. This limits …
interactive service, running alongside one or more low-priority, best-effort jobs. This limits …
A survey of techniques for cache partitioning in multicore processors
S Mittal - ACM Computing Surveys (CSUR), 2017 - dl.acm.org
As the number of on-chip cores and memory demands of applications increase, judicious
management of cache resources has become not merely attractive but imperative. Cache …
management of cache resources has become not merely attractive but imperative. Cache …
[PDF][PDF] Research problems and opportunities in memory systems
The memory system is a fundamental performance and energy bottleneck in almost all
computing systems. Recent system design, application, and technology trends that require …
computing systems. Recent system design, application, and technology trends that require …
Karma: Resource allocation for dynamic demands
The classical max-min fairness algorithm for resource allocation provides many desirable
properties, eg, Pareto efficiency, strategy-proofness and fairness. This paper builds upon the …
properties, eg, Pareto efficiency, strategy-proofness and fairness. This paper builds upon the …
SWAP: Effective fine-grain management of shared last-level caches with minimum hardware support
Performance isolation is an important goal in server-class environments. Partitioning the last-
level cache of a chip multiprocessor (CMP) across co-running applications has proven …
level cache of a chip multiprocessor (CMP) across co-running applications has proven …
Greedy combinatorial test case generation using unsatisfiable cores
Combinatorial testing aims at covering the interactions of parameters in a system under test,
while some combinations may be forbidden by given constraints (forbidden tuples). In this …
while some combinations may be forbidden by given constraints (forbidden tuples). In this …
Holistic resource allocation for multicore real-time systems
This paper presents CaM, a holistic cache and memory bandwidth resource allocation
strategy for multicore real-time systems. CaM is designed for partitioned scheduling, where …
strategy for multicore real-time systems. CaM is designed for partitioned scheduling, where …
The main memory system: Challenges and opportunities
The memory system is a fundamental performance and energy bottleneck in almost all
computing systems. Recent system design, application, and technology trends that require …
computing systems. Recent system design, application, and technology trends that require …
Dynamic proportional sharing: A game-theoretic approach
Sharing computational resources amortizes cost and improves utilization and efficiency.
When agents pool their resources together, each becomes entitled to a portion of the shared …
When agents pool their resources together, each becomes entitled to a portion of the shared …
Dna: Dynamic resource allocation for soft real-time multicore systems
Modern latency-sensitive and real-time systems often use multi-core platforms; thus, tasks
on different cores share certain hardware resources, such as the memory bus and certain …
on different cores share certain hardware resources, such as the memory bus and certain …