Search History  -  Selected Records  -  My Profile  -  My Alerts End Session
Easy Search Quick Search Expert Search Thesaurus eBook Search Ask an Expert Help
Abstract  -  Detailed
               
Record 50 from Inspec for: ((meybodi) WN All fields), 1790-2007
Check record to add to Selected Records
50. A reliable optimization on distributed mutual exclusion algorithm
Challenger, M. (Dept. of Comput. Eng., IAU of Shabestar, Iran); Bayat, P.; Meybodi, M.R. Source: 2006 2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (IEEE Cat. No. 06EX1274C), 2006, 8 pp.
ISBN: 1 4244 0106 2
Conference: 2006 2nd International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, 1-3 March 2006 , Barcelona, Spain Sponsor: IEEE ComSoc.;IEEE;Create-Net;The Int. Commun. Sci. and Technol. Assoc
Publisher: IEEE, Piscataway, NJ, USA


Abstract: This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure happens in system, the algorithm protects the distributed system against any crash. It also makes possible the recovery of lost data in system. It requires between (N-1) and 2(N-1) messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a order function of clients in computation. The algorithm does not introduce any other overhead over Lamport's and Ricart-Agrawala's algorithms, which require 3(N-1) and 2(N-1) messages per critical section access, respectively
(23 refs.)

Inspec controlled terms:
computer network reliability  -  message passing  -  optimisation

Classification Code:   
B6210L Computer communications  -  C5620 Computer networks and techniques  -  C6150N Distributed systems software

Database: Inspec

  Full-text and Local Holdings Links

About Ei  -  About Engineering Village  -  Feedback  -  Privacy Policy
© 2006 Elsevier Inc. All rights reserved.