Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks
| hal.structure.identifier | Algorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL] | |
| hal.structure.identifier | Laboratoire de l'Informatique du Parallélisme [LIP] | |
| dc.contributor.author | BENOIT, Anne | |
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | LARCHEVÊQUE, Hubert | |
| hal.structure.identifier | Algorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL] | |
| hal.structure.identifier | Laboratoire de l'Informatique du Parallélisme [LIP] | |
| dc.contributor.author | RENAUD-GOUD, Paul | |
| dc.date.accessioned | 2024-04-15T09:45:48Z | |
| dc.date.available | 2024-04-15T09:45:48Z | |
| dc.date.created | 2011-09 | |
| dc.date.issued | 2011-09 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197951 | |
| dc.description.abstractEn | 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. | |
| dc.language.iso | en | |
| dc.subject.en | Replica placement | |
| dc.subject.en | distance constraints | |
| dc.subject.en | optimal algorithms | |
| dc.subject.en | approximation algorithms | |
| dc.subject.en | tree networks | |
| dc.subject.en | binary tree | |
| dc.subject.en | single vs multiple policy. | |
| dc.subject.en | single vs multiple policy | |
| dc.title.en | Optimal algorithms and approximation algorithms for replica placement with distance constraints in tree networks | |
| dc.type | Rapport | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.page | 26 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.type.institution | INRIA | |
| bordeaux.type.report | rr | |
| hal.identifier | inria-00630292 | |
| hal.version | 1 | |
| hal.audience | Non spécifiée | |
| hal.origin.link | https://hal.archives-ouvertes.fr//inria-00630292v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2011-09&rft.spage=26&rft.epage=26&rft.au=BENOIT,%20Anne&LARCHEV%C3%8AQUE,%20Hubert&RENAUD-GOUD,%20Paul&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||