BENOIT, Anne; LARCHEVÊQUE, Hubert; RENAUD-GOUD, Paul

doi:10.1109/IPDPS.2012.95

Métadonnées

Licence d’utilisation du document

BENOIT, Anne
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]

LARCHEVÊQUE, Hubert
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]

RENAUD-GOUD, Paul
Laboratoire de l'Informatique du Parallélisme [LIP]
Optimisation des ressources : modèles, algorithmes et ordonnancement [ROMA]

Langue

Communication dans un congrès

Ce document a été publié dans

Proceedings of IPDPS 2012, 2012-05-21, Shanghai. 2012

IEEE

Résumé en anglais

In this paper, we study the problem of replica placement in tree networks subject to server capacity and distance constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. The Single policy enforces that all requests of a client are served by a single server in the tree, while in the Multiple policy, the requests of a given client can be processed by multiple servers, thus distributing the processing of requests over the platform. For the Single policy, we prove that all instances of the problem are NP-hard, and we propose approximation algorithms. The problem with the Multiple policy was known to be NP-hard with distance constraints, but we provide a polynomial time optimal algorithm to solve the problem in the particular case of binary trees when no request exceeds the server capacity.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche