Coupled placement in modern data centers

We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the two have traditionally been addressed independently in data centers, two modern trends make it beneficial to consider them together in a coupled manner: (a) rise in virtualization technologies, which enable applications packaged as VMs to be run on any server in the data center with spare compute resources, and (b) rise in multi-purpose hardware devices in the data center which provide compute resources of varying capabilities at different proximities from the storage nodes. We present a novel framework called CPA for addressing such coupled placement of application data and computation in modern data centers. Based on two well-studied problems – Stable Marriage and Knapsacks – the CPA framework is simple, fast, versatile and automatically enables high throughput applications to be placed on nearby server...

• Type: Conference
• Year: 2009
• Where: IPPS
• Authors: Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
• Keywords: Data Center, Distributed And Parallel Computing, IPPS 2009, Modern Data Centers, Storage Nodes