Application placement on a cluster of servers

Bhuvan Urgaonkar, Arnold L. Rosenberg, Prashant Shenoy

Research output: Contribution to journalArticle

52 Citations (Scopus)

Abstract

The APPLICATION PLACEMENT PROBLEM (APP, for short) arises in hosting platforms: clusters of servers that are used for hosting large, distributed applications such as Internet services. Hosting platforms imply a business relationship between an entity called the platform provider and a number of entities called the application providers. The latter pay the former for the resources on the hosting platform, in return for which, the former provides guarantees on resource availability for the applications. This implies that a hosting platform should host only applications for which it has sufficient resources. The objective of the APP is to maximize the number of applications that can be hosted on the platform while satisfying their resource requirements. The complexity of the APP is studied here, with the following results. The general APP is NP-hard; indeed, even restricted versions of the APP may not admit polynomial-time approximation schemes. However, several significant variants of the online version of the APP admit efficient approximation algorithms.

Original languageEnglish (US)
Pages (from-to)1023-1041
Number of pages19
JournalInternational Journal of Foundations of Computer Science
Volume18
Issue number5
DOIs
StatePublished - Oct 1 2007

Fingerprint

Servers
Approximation algorithms
Application programs
Polynomials
Availability
Internet
Industry

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

Urgaonkar, Bhuvan ; Rosenberg, Arnold L. ; Shenoy, Prashant. / Application placement on a cluster of servers. In: International Journal of Foundations of Computer Science. 2007 ; Vol. 18, No. 5. pp. 1023-1041.
@article{28e1212444844f91bc79e63b5ad83648,
title = "Application placement on a cluster of servers",
abstract = "The APPLICATION PLACEMENT PROBLEM (APP, for short) arises in hosting platforms: clusters of servers that are used for hosting large, distributed applications such as Internet services. Hosting platforms imply a business relationship between an entity called the platform provider and a number of entities called the application providers. The latter pay the former for the resources on the hosting platform, in return for which, the former provides guarantees on resource availability for the applications. This implies that a hosting platform should host only applications for which it has sufficient resources. The objective of the APP is to maximize the number of applications that can be hosted on the platform while satisfying their resource requirements. The complexity of the APP is studied here, with the following results. The general APP is NP-hard; indeed, even restricted versions of the APP may not admit polynomial-time approximation schemes. However, several significant variants of the online version of the APP admit efficient approximation algorithms.",
author = "Bhuvan Urgaonkar and Rosenberg, {Arnold L.} and Prashant Shenoy",
year = "2007",
month = "10",
day = "1",
doi = "10.1142/S012905410700511X",
language = "English (US)",
volume = "18",
pages = "1023--1041",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "5",

}

Application placement on a cluster of servers. / Urgaonkar, Bhuvan; Rosenberg, Arnold L.; Shenoy, Prashant.

In: International Journal of Foundations of Computer Science, Vol. 18, No. 5, 01.10.2007, p. 1023-1041.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Application placement on a cluster of servers

AU - Urgaonkar, Bhuvan

AU - Rosenberg, Arnold L.

AU - Shenoy, Prashant

PY - 2007/10/1

Y1 - 2007/10/1

N2 - The APPLICATION PLACEMENT PROBLEM (APP, for short) arises in hosting platforms: clusters of servers that are used for hosting large, distributed applications such as Internet services. Hosting platforms imply a business relationship between an entity called the platform provider and a number of entities called the application providers. The latter pay the former for the resources on the hosting platform, in return for which, the former provides guarantees on resource availability for the applications. This implies that a hosting platform should host only applications for which it has sufficient resources. The objective of the APP is to maximize the number of applications that can be hosted on the platform while satisfying their resource requirements. The complexity of the APP is studied here, with the following results. The general APP is NP-hard; indeed, even restricted versions of the APP may not admit polynomial-time approximation schemes. However, several significant variants of the online version of the APP admit efficient approximation algorithms.

AB - The APPLICATION PLACEMENT PROBLEM (APP, for short) arises in hosting platforms: clusters of servers that are used for hosting large, distributed applications such as Internet services. Hosting platforms imply a business relationship between an entity called the platform provider and a number of entities called the application providers. The latter pay the former for the resources on the hosting platform, in return for which, the former provides guarantees on resource availability for the applications. This implies that a hosting platform should host only applications for which it has sufficient resources. The objective of the APP is to maximize the number of applications that can be hosted on the platform while satisfying their resource requirements. The complexity of the APP is studied here, with the following results. The general APP is NP-hard; indeed, even restricted versions of the APP may not admit polynomial-time approximation schemes. However, several significant variants of the online version of the APP admit efficient approximation algorithms.

UR - http://www.scopus.com/inward/record.url?scp=34748908375&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34748908375&partnerID=8YFLogxK

U2 - 10.1142/S012905410700511X

DO - 10.1142/S012905410700511X

M3 - Article

AN - SCOPUS:34748908375

VL - 18

SP - 1023

EP - 1041

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 5

ER -