• Server allocation algorithms f...

Result: Server allocation algorithms for tiered systems

Title:
Server allocation algorithms for tiered systems
Authors:
CHAUDHURI, Kamalika, KOTHARI, Anshul, PENDAVINGH, Rudi, SWAMINATHAN, Ram, TARJAN, Robert, YUNHONG ZHOU
Source:
11th Annual International Conference on Computing and CombinatoricsAlgorithmica. 48(2):129-146
Publisher Information:
New York, NY: Springer, 2007.
Publication Year:
2007
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Algorithme rapide, Fast algorithm, Algoritmo rápido, Allocation ressource, Resource allocation, Asignación recurso, Complexité calcul, Computational complexity, Complejidad computación, Décision multiple, Multiple decision, Decisión múltiple, File attente, Queue, Fila espera, Fonction réponse, Response function, Función respuesta, Internet, Modèle non linéaire, Non linear model, Modelo no lineal, Modélisation, Modeling, Modelización, Méthode polynomiale, Polynomial method, Método polinomial, Métrique, Metric, Métrico, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Problème NP complet, NP complete problem, Problema NP completo, Problème sac à dos, Knapsack problem, Problema mochila, Programmation mathématique, Mathematical programming, Programación matemática, Qualité service, Service quality, Calidad servicio, Réponse temporelle, Time response, Respuesta temporal, Réseau web, World wide web, Red WWW, Serveur informatique, Computer server, Servidor informático, Système n niveaux, Multilevel system, Sistema n niveles, Temps polynomial, Polynomial time, Tiempo polinomial, Temps réponse, Response time, Tiempo respuesta, Multiple-choice knapsack problem, Tiered system
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computer Science Division, University of California, Berkeley, CA 94720, United States
Computer Science Department, University of California, Santa Barbara, CA 93106, United States
Department of Mathematics and Computing Science, TU Eindhoven, Eindhoven, Netherlands
HP Labs, 1501 Page Mill Rd, Palo Alto, CA 94304, United States
Department of Computer Science, Princeton University, Princeton, NJ 08540, United States
ISSN:
0178-4617
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18912913
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18912913
Database:
PASCAL Archive

Further Information

Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS metrics for these applications is the expected response time for the user. Since the expected response time in any tier depends upon the number of servers allocated to this tier, and a request's total response time is the sum of the response times over all the tiers, many different configurations (number of servers allocated to each tier) can satisfy the expected response-time requirement. Naturally, one would like to find the configuration that minimizes the total system cost while satisfying the total response-time requirement. This is modeled as a non-linear optimization problem using an open-queuing network model of response time, which we call the server allocation problem for tiered systems (SAPTS). In this paper we study the computational complexity of SAPTS and design efficient algorithms to solve it. For a variable number of tiers, we show that the decision version of SAPTS is NP-complete. Then we design a simple two-approximation algorithm and a fully polynomial-time approximation scheme (FPTAS). If the number of tiers is a constant, we show that SAPTS is polynomial-time solvable. Furthermore, we design a fast polynomial-time exact algorithm to solve the important two-tier case. Most of our results extend to the general case in which each tier has an arbitrary response-time function.