ACM Home Page
Please provide us with feedback. Feedback
Integrated resource allocation in heterogeneous SAN data centers
Full text PdfPdf (210 KB)
Source
Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing table of contents
Portland, Oregon, USA
SESSION: Brief announcements - track A table of contents
Pages: 328 - 329  
Year of Publication: 2007
ISBN:978-1-59593-616-5
Authors
Aameek Singh  IBM Almaden Research Center, San Jose, CA
Madhukar Korupolu  IBM Almaden Research Center, San Jose, CA
Bhuvan Bamba  Georgia Tech, Atlanta, GA
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 97,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1281100.1281156
What is a DOI?

ABSTRACT

Modern data centers are complex distributed environments with application workloads requiring multiple resources like processing (CPU), storage and network. Allocation of these resources to workloads needs to be handled in an integrated manner to adequately capture the relationships between different resource nodes like connectivity between an application server and storage controller in the storage area network (SAN). As data centers grow over time, heterogeneous resources coexist at the same time and this heterogeneity adds further complexity to manual resource allocation.

In this work, we describe various challenges and key insights in performing fast, automatic integrated resource allocation. We briefly introduce our novel framework called SPARK (Stable-Proposals-And-Resource Knapsacks) that uses server virtualization to address combined placement of application data and CPU in SAN data centers. SPARK is based on two well-studied problems -- Stable Marriage and Knapsacks -- and is simple, fast, versatile and highly scalable. Our initial experiments show promise of our approach, consistently outperforming natural candidate algorithms by 30-40% and being within 4% of the LP-based optimal values for a wide range of experiments.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
DB2 Offloading to IBM DS8000, Tiburon Project.
 
2
Cisco MDS 9000 Family SANTap Service.
 
3
E. Anderson et al "Ergastulum: quickly finding near-optimal storage system designs", HP Labs SSP HPL-SSP-2001-05, 2002.
 
4
5


Collaborative Colleagues:
Aameek Singh: colleagues
Madhukar Korupolu: colleagues
Bhuvan Bamba: colleagues