NDLI: Integrated resource allocation in heterogeneous SAN data centers

Please wait, while we are loading the content...

Constant-RMR implementations of CAS and other synchronization primitives using read and write operations

Reconstructing approximate tree metrics

Towards fast decentralized construction of locality-aware overlay networks

Refined quorum systems

Distributed approximate matching

Broadcasting in udg radio networks with unknown topology

On the weakest failure detector ever

Greedy distributed optimization of multi-commodity flows

Partition approach to failure detectors for k-set agreement

On local representation of distances in trees

Transactional memory for a modern microprocessor

SNZI: scalable NonZero indicators

A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs

On the complexity of greedy routing in ring-based peer-to-peer networks

Efficient fork-linearizable access to untrusted shared memory

Controller and estimator for dynamic networks

Communication in dynamic radio networks

Tolerating corrupted communication

Distributed network monitoring and multicommodity flows: a primal-dual approach

Failure detectors are schedulers

Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach

The Akamai approach to achieving performance and reliability on the internet

Abortable and query-abortable objects and their efficient implementation

Improved sparse covers for graphs excluding a fixed minor

Constructing scalable overlays for pub-sub with many topics

Verifying distributed erasure-coded data

A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners

Time-decaying sketches for sensor data aggregation

Optimal inter-object correlation when replicating for availability

The price of anarchy in network creation games

Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

Game authority for robust andscalable distributed selfish-computer systems

Paxos made live: an engineering perspective

Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS

Compact routing with slack in low doubling dimension

Truth in advertising: lightweight verification of route integrity

Summarizing data using bottom-k sketches

Graceful degradation via versions: specifications and implementations

Network formation games with local coalitions

Remote storage with byzantine servers

Theory of BAR games

Compact routing with slack

Countering web spam with credibility-based link analysis

Towards the minimal synchrony for byzantine consensus

An algorithm composition scheme preserving monotonicity

Multicoordinated Paxos

An incentive-compatible multi-armed bandit mechanism

The complexity of updating multi-writer snapshot objects

On cost sharing mechanisms in the network design game

From an intermittent rotating star to a leader

Asynchronous recommendation systems

Constant phase efficient protocols for secure message transmission in directed networks

Bringing order to BGP: decreasing time and message complexity

Space adaptation: privacy-preserving multiparty collaborative mining with geometric perturbation

A denial-of-service resistant DHT

Practical private computation of vector addition-based functions

Measuring robustness of superpeer topologies

Integrated resource allocation in heterogeneous SAN data centers

SuperTrust: a secure and efficient framework for handling trust in super-peer networks

d-clock: distributed QoS in heterogeneous resource environments

Toward an optimal social network defense against Sybil attacks

Configurations: a model for distributed data storage

Trinitya: distributed defense against transient spam-bots

A formal treatment of an abstract channel implementation using java sockets and TCP

Non-searchability of random scale-free graphs

Transactions and privatization in Delaunay triangulation

Distributed broadcasting and mapping protocols in directed anonymous networks

Privatization techniques for software transactional memory

Optimal atomic broadcast and multicast algorithms for wide area networks

From causal to z-linearizable transactional memory

Solvability of geocasting in mobile ad-hoc networks

The power of DCAS: highly-concurrent software transactional memory

Geographic gossip on geometric random graphs via affine combinations

Object replication degree customization for high availability

Practical summation via gossip

Sharpness, a tight condition for throughput scalability

Distributed algorithms for dynamic coverage in sensor networks

An analysis of intention preservation in group editors

DoS-resilient secure aggregation queries in sensor networks

The coBFIT toolkit

Self-stabilizing counting in mobile sensor networks

Integrated resource allocation in heterogeneous SAN data centers

Content Provider	ACM Digital Library
Author	Singh, Aameek Korupolu, Madhukar Bamba, Bhuvan
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.
Starting Page	328
Ending Page	329
Page Count	2
File Format	PDF
ISBN	9781595936165
DOI	10.1145/1281100.1281156
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2007-08-12
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Integrated allocation San resource management
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in