2013 IEEE 33rd International Conference on Distributed Computing Systems 2013
DOI: 10.1109/icdcs.2013.50
|View full text |Cite
|
Sign up to set email alerts
|

Proteus: Power Proportional Memory Cache Cluster in Data Centers

Abstract: In this paper, we describe the design, implementation and evaluation of Proteus, a power-proportional cache cluster which eliminates the delay penalty during server provisioning dynamics. To speed up data center services, a cache cluster is used in front of the database tier, providing fast in-cache data access. Since the number of cache servers is large, building power-proportional cache clusters can lead to considerable monetary savings. Dynamic server provisioning, one common methodology for realizing power… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Proteus [34] is a dynamic server provisioning framework for memory cache cluster, which provides deterministic memory load balancing under provisioning dynamics. Similarly, Hwang et al [27] proposed an adaptive hash space partitioning approach that allows hash space boundary shifts between unbalanced cache nodes without further dividing the hash space.…”
Section: Related Workmentioning
confidence: 99%
“…Proteus [34] is a dynamic server provisioning framework for memory cache cluster, which provides deterministic memory load balancing under provisioning dynamics. Similarly, Hwang et al [27] proposed an adaptive hash space partitioning approach that allows hash space boundary shifts between unbalanced cache nodes without further dividing the hash space.…”
Section: Related Workmentioning
confidence: 99%
“…It requires algorithms that minimize unnecessary data movement, while performing autoscaling. These algorithms must amortize cost of data movement over time [82]. The latter may require a prediction of future data access patterns [68].…”
Section: Energy-proportionality and Energy-efficient Operationmentioning
confidence: 99%