A Fault-Tolerant Algorithm For Distributed Resource Allocation

Autores
Pessolani, Pablo Andrés; Jara, Oscar; Gonnet, Silvio M.; Cortés, Toni; Tinetti, Fernando Gustavo
Año de publicación
2017
Idioma
español castellano
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Resource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.
Facultad de Informática
Materia
Ciencias Informáticas
Distributed Systems
Distributed Resource Allocation
Fault tolerance
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/81185
Acceder
id SEDICI_1ade8c78ff6d0728508ff9a8bacfedec
oai_identifier_str oai:sedici.unlp.edu.ar:10915/81185
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A Fault-Tolerant Algorithm For Distributed Resource AllocationPessolani, Pablo AndrésJara, OscarGonnet, Silvio M.Cortés, ToniTinetti, Fernando GustavoCiencias InformáticasDistributed SystemsDistributed Resource AllocationFault toleranceResource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.Facultad de Informática2017info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf2152-2163http://sedici.unlp.edu.ar/handle/10915/81185spainfo:eu-repo/semantics/altIdentifier/url/https://ieeexplore.ieee.org/document/8070421info:eu-repo/semantics/altIdentifier/issn/1548-0992info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-11-05T12:54:27Zoai:sedici.unlp.edu.ar:10915/81185Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-11-05 12:54:27.51SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A Fault-Tolerant Algorithm For Distributed Resource Allocation
title A Fault-Tolerant Algorithm For Distributed Resource Allocation
spellingShingle A Fault-Tolerant Algorithm For Distributed Resource Allocation
Pessolani, Pablo Andrés
Ciencias Informáticas
Distributed Systems
Distributed Resource Allocation
Fault tolerance
title_short A Fault-Tolerant Algorithm For Distributed Resource Allocation
title_full A Fault-Tolerant Algorithm For Distributed Resource Allocation
title_fullStr A Fault-Tolerant Algorithm For Distributed Resource Allocation
title_full_unstemmed A Fault-Tolerant Algorithm For Distributed Resource Allocation
title_sort A Fault-Tolerant Algorithm For Distributed Resource Allocation
dc.creator.none.fl_str_mv Pessolani, Pablo Andrés
Jara, Oscar
Gonnet, Silvio M.
Cortés, Toni
Tinetti, Fernando Gustavo
author Pessolani, Pablo Andrés
author_facet Pessolani, Pablo Andrés
Jara, Oscar
Gonnet, Silvio M.
Cortés, Toni
Tinetti, Fernando Gustavo
author_role author
author2 Jara, Oscar
Gonnet, Silvio M.
Cortés, Toni
Tinetti, Fernando Gustavo
author2_role author
author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Distributed Systems
Distributed Resource Allocation
Fault tolerance
topic Ciencias Informáticas
Distributed Systems
Distributed Resource Allocation
Fault tolerance
dc.description.none.fl_txt_mv Resource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.
Facultad de Informática
description Resource allocation is a usual problem that must be faced during a distributed system design. Despite the large number of algorithms proposed in literature to solve this problem, most papers lack of detailed descriptions about how to turn these algorithms into real-world reliable protocols. This article presents a fault-tolerant algorithm for distributed resource allocation named SLOTS which is implemented as an executable protocol. It allocates resources among members in a fairly manner using simple heuristics and employing a donation approach. SLOTS supports the dynamic behavior of clusters and provides high availability services. It bases its fault-tolerance properties and membership changes in atomic sets of operations (like transactions) using services provided by an underlying Group Communication System.
publishDate 2017
dc.date.none.fl_str_mv 2017
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/81185
url http://sedici.unlp.edu.ar/handle/10915/81185
dc.language.none.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://ieeexplore.ieee.org/document/8070421
info:eu-repo/semantics/altIdentifier/issn/1548-0992
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
2152-2163
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1847978583136403456
score 12.61048

Publicaciones similares