dc.creatorPessolani, Pablo Andrés
dc.creatorJara, Oscar
dc.creatorGonnet, Silvio M.
dc.creatorCortés, Toni
dc.creatorTinetti, Fernando Gustavo
dc.date2017
dc.date2019-09-13T17:51:45Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/81185
dc.identifierhttps://ieeexplore.ieee.org/document/8070421
dc.identifierissn:1548-0992
dc.descriptionResource 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.
dc.descriptionFacultad de Informática
dc.formatapplication/pdf
dc.format2152-2163
dc.languagees
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectCiencias Informáticas
dc.subjectDistributed Systems
dc.subjectDistributed Resource Allocation
dc.subjectFault tolerance
dc.titleA Fault-Tolerant Algorithm For Distributed Resource Allocation
dc.typeArticulo
dc.typeArticulo


Este ítem pertenece a la siguiente institución