Un Algoritmo Tolerante a Fallos Para Asignación Distribuida de Recursos (A Fault-Tolerant Algorithm For Distributed Resource Allocation)

Pablo Pessolani (ppessolani@hotmail.com)1, Oscar Jara (oajara@gmail.com)1, Silvio Gonnet (sgonnet@santafe-conicet.gov.ar)2, Toni Cortés (toni.cortes@bsc.es)3, Fernando G. Tinetti (fernando@info.unlp.edu.ar)4

1Universidad Tecnológica Nacional - Facultad Regional Santa Fe
2Instituto de Desarrollo y Diseño INGAR
3Barcelona Supercomputing Center (BSC)
4Universidad Nacional de La Plata - Facultad de Informática

This paper appears in: Revista IEEE América Latina

Publication Date: Nov. 2017
Volume: 15,   Issue: 11 
ISSN: 1548-0992

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

Index Terms:
Distributed Systems, Distributed Resource Allocation, Fault Tolerance   

Documents that cite this document
This function is not implemented yet.

[PDF Full-Text (813)]