A mutual exclusion algorithm for mobile agents-based applications

Authors:
Chun Cao;Jiannong Cao;Xiaoxing Ma;Jian Lü
Affiliations:
State Key Laboratory of Novel Software Technology, Nanjing University, China;Department of Computing, Hong Kong Polytechnic University, Hong Kong SAR;State Key Laboratory of Novel Software Technology, Nanjing University, China;State Key Laboratory of Novel Software Technology, Nanjing University, China
Venue:
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Year:
2007

Citing 9
Cited 0

A taxonomy of distributed mutual exclusion

Journal of Parallel and Distributed Computing
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms

IEEE Transactions on Parallel and Distributed Systems
A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
Seven good reasons for mobile agents

Communications of the ACM
A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
Token based solutions to M resources allocation problem

SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles

Quantified Score

Hi-index	0.00

Visualization

Abstract

The mobile agent (MA) technology has been widely applied in distributed applications. However, since mobile agents are highly autonomous, coordinating the their behaviours is hard. We concentrate on the mutual exclusion issue in this paper and propose an algorithm for achieving mutex among mobile agents. In contrast to the existing algorithms for traditional distributed processes, the proposed algorithm does not require MAs to have a pre-knowledge about other competitors, nor the total number of them. MAs can join/leave the competition session freely. The algorithm performance is also evaluated through simulations.