Sciweavers

339 search results - page 11 / 68
» Performance of Fair Distributed Mutual Exclusion Algorithms
Sort
View
ENTCS
2002
120views more  ENTCS 2002»
13 years 7 months ago
Composition of Distributed Software with Algon - Concepts and Possibilities
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...
Judith Bishop, Karen Renaud, Basil Worrall
IEEECIT
2005
IEEE
14 years 1 months ago
Analysis of the Suzuki-Kasami Algorithm with SAL Model Checkers
We report on a case study in which SAL model checkers have been used to analyze the Suzuki-Kasami distributed mutual exclusion algorithm with respect to the mutual exclusion prope...
Kazuhiro Ogata, Kokichi Futatsugi
ICS
1999
Tsinghua U.
13 years 11 months ago
Application scaling under shared virtual memory on a cluster of SMPs
In this paper we examine how application performance scales on a state-of-the-art shared virtual memory (SVM) system on a cluster with 64 processors, comprising 4-way SMPs connect...
Dongming Jiang, Brian O'Kelley, Xiang Yu, Sanjeev ...
PODC
2010
ACM
13 years 11 months ago
Constant RMR solutions to reader writer synchronization
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
Vibhor Bhatt, Prasad Jayanti
FSTTCS
2000
Springer
13 years 11 months ago
Formal Verification of the Ricart-Agrawala Algorithm
Abstract. This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Tem...
Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ar...