Sciweavers

503 search results - page 30 / 101
» Live Debugging of Distributed Systems
Sort
View
FSTTCS
2000
Springer
15 years 5 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...
TC
2002
15 years 1 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
OSDI
2002
ACM
16 years 2 months ago
An Integrated Experimental Environment for Distributed Systems and Networks
Three experimental environments traditionally support network and distributed systems research: network emulators, network simulators, and live networks. The continued use of mult...
Brian White, Jay Lepreau, Leigh Stoller, Robert Ri...
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
16 years 2 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
COLING
1996
15 years 3 months ago
Communication in large distributed AI Systems for Natural Language Processing
We. are going to describe the design and implementatior, of a connnuniealion system l.or large AI projects, capable of supporting various software components in a heterogeneous ha...
Jan W. Amtrup, Jörg Benra