Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Dynamic Partitioning of the Cache Hierarchy in Shared Data Centers
 

Summary: Dynamic Partitioning of the Cache Hierarchy in
Shared Data Centers
Gokul Soundararajan, Jin Chen
, Mohamed A. Sharaf and Cristiana Amza
Department of Electrical and Computer Engineering
Department of Computer Science
University of Toronto
ABSTRACT
Due to the imperative need to reduce the management costs
of large data centers, operators multiplex several concurrent
database applications on a server farm connected to shared
network attached storage. Determining and enforcing per-
application resource quotas in the resulting cache hierarchy,
on the fly, poses a complex resource allocation problem span-
ning the database server and the storage server tiers. This
problem is further complicated by the need to provide strict
Quality of Service (QoS) guarantees to hosted applications.
In this paper, we design and implement a novel coordi-
nated partitioning technique of the database buffer pool and
storage cache between applications for any given cache re-

  

Source: Amza, Cristiana - Department of Electrical and Computer Engineering, University of Toronto

 

Collections: Computer Technologies and Information Sciences