See this document in CiteSeerX!

Resource Assignment for Large-Scale Computing Utilities Using Mathematical Programming (2003)  (Make Corrections)  
Xiaoyun Zhu, Cipriano Santos, Julie Ward, Dirk Beyer, Sharad Singhal



  Home/Search   Context   Related

 
View or download:
hp.com/techreports...HPL2003243R1.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  hp.com/techrepor...HPL2003243R1 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper, we describe a resource assignment problem (RAP) for a large-scale computing utility, such as an Internet data center. The problem is defined as follows: For a given topology of a network consisting of switches and servers with varying capabilities, and for a given application with a distributed architecture, decide which server from the physical network should be assigned to each application component, such that the trafficweighted average inter-server distance is minimized, and... (Update)

Active bibliography (related documents):   More   All
0.7:   Utility-Directed Allocation - Kelly (2003)   (Correct)
0.5:   Dynamic Surge Protection: An Approach to Handling.. - Lassettre.. (2003)   (Correct)
0.3:   Web Transaction Analysis and Optimization (TAO) - Pankaj Garg Ming (2002)   (Correct)

Similar documents based on text:   More   All
0.4:   A Mathematical Optimization Approach for Resource.. - Cipriano Santos Xiaoyun (2002)   (Correct)
0.3:   Automated Generation of Resource Configurations through.. - Akhil Sahai Sharad (2004)   (Correct)
0.3:   The Caltech Helicopter Control Experiment - Zhu, Van Nieuwstadt (1996)   (Correct)

BibTeX entry:   (Update)

@misc{ zhu-resource,
  author = "Xiaoyun Zhu and Cipriano Santos and Julie Ward and Dirk Beyer and Sharad
    Singhal",
  title = "Resource Assignment for Large-Scale Computing Utilities Using Mathematical
    Programming",
  url = "citeseer.ist.psu.edu/zhu03resource.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
93   Comparative models of the file assignment problem (context) - Dowdy, Foster - 1982
86   Integer Programming (context) - Wolsey - 1998
36   Englewood Cliffs (context) - Ahuja, Magnanti et al. - 1993
25   A heuristic algorithm and simulation approach to relative lo.. (context) - Armour, Buffa - 1963
22   and Internetworking Protocols (context) - Perlman, Bridges et al. - 1999
12   edited by Ian Foster and Carl Kesselman (context) - Grid, for et al. - 1998
11   Adaptive Internet data centers - Rolia, Singhal et al. - 2000
9   Heuristic algorithms for constructing optimized structures i.. (context) - Banerjee, Mukherjee et al. - 1994
6   Ergastulum: quickly finding near-optimal storage system desi.. - Anderson, Kallahalla et al.
6   A mathematical optimization approach for resource allocation.. - Santos, Zhu et al. - 2002
5   MULTICS -- the first seven years (context) - Corbato, Saltzer et al. - 1972
5   Optimal resource assignment in Internet data centers (context) - Zhu, Singhal
3   Testing scalability of the mathematical programming approach.. (context) - Santos, Zhu - 2003
2   Resource access management for a utility hosting enterprise .. (context) - Rolia, Zhu et al. - 2003
1   Living in an on demand world (context) - Machines - 2002
1   BandwidthConstrained allocation in Grid computing - Kothari, Suri et al. - 2003
1   N1 - Introducing just-in-time computing (context) - Microsystems - 2002
1   Utility Data Center: HP's first proof point for service-cent.. (context) - Turner - 2001
1   Combinatorial algorithms: generation, enumeration, and searc.. (context) - Kreher, Stinson - 1999
1   Building dynamic data center (context) - Corporation - 2003
1   IDC layout is NP-hard (context) - Shahoumian - 2002
1   Designing nextgeneration fabrics with Brocade switches (context) - Systems - 2001
www.ilog.com

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC