Federico Fariña

Learn More
Leader election is a fundamental problem in distributed computing and it has been studied assuming various computation models and network topologies. This paper analyzes the algorithms for leader election in complete networks using asynchronous communication channels. We present a novel algorithm that reduces the information necessary to select a leader(More)
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of previous proposals. The algorithm has a communication cost of 2n - 1 messages and a latency of n /spl middot/ T for a deadlock cycle of n processes, where T is the inter-site(More)
Distributed database system provides resource sharing environment for optimal performance of various database activities, especially when data is spread over a large number of sites. Distributed nature of transactions occurring at different sites and requiring resources from diverse sites pose various operational problems, such as deadlocks, concurrency and(More)
This work introduces a new distributed history-based algorithm for deadlock detection and resolution under the single-unit request model. The algorithm has a communication cost of O(n /spl middot/ log n) messages for a deadlock cycle of n processes. This low cost is achieved by means of two mechanisms. On one hand, to reduce the number of instance(More)
In this paper we introduce a new distributed deadlock detection/resolution algorithm that achieves a linear message complexity. This proposal is based on the operation and behaviour of an election algorithm designed for logical rings in totally connected networks. The algorithm operates like that election algorithm in static configurations and tries to(More)