Sciweavers

1448 search results - page 4 / 290
» Deadlock Detection in Distributed Systems
Sort
View
SRDS
2000
IEEE
14 years 1 days ago
Using Multicast Communication to Reduce Deadlock in Replicated Databases
Obtaining good performance from a distributed replicated database that allows update transactions to originate at any site while ensuring one-copy serializability is a challenge. ...
JoAnne Holliday, Divyakant Agrawal, Amr El Abbadi
ENTCS
2010
77views more  ENTCS 2010»
13 years 7 months ago
Transparent First-class Futures and Distributed Components
Futures are special kind of values that allow the synchronisation of different processes. Futures are in fact identifiers for promised results of function calls that are still awa...
Antonio Cansado, Ludovic Henrio, Eric Madelaine
SPIN
2000
Springer
13 years 11 months ago
Model-Checking Multi-threaded Distributed Java Programs
Systematic state-space exploration is a powerful technique for veri cation of concurrent software systems. Most work in this area deals with manually-constructed models of those sy...
Scott D. Stoller
EMSOFT
2009
Springer
14 years 2 months ago
Compositional deadlock detection for rendezvous communication
Concurrent programming languages are growing in importance with the advent of multi-core systems. However, concurrent programs suffer from problems, such as data races and deadloc...
Baolin Shao, Nalini Vasudevan, Stephen A. Edwards
EMSOFT
2006
Springer
13 years 11 months ago
Efficient distributed deadlock avoidance with liveness guarantees
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
César Sánchez, Henny B. Sipma, Zohar...