35 search results - page 1 / 7 » Efficient distributed deadlock avoidance with liveness guara... |
EMSOFT
2006
Springer
13 years 8 months ago
2006
Springer
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...
FASE
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We study resource management in distributed systems. Incorrect handling of resources may lead to deadlocks, missed deadlines, priority inversions, and other forms of inco...
OOPSLA
2004
Springer
13 years 10 months ago
2004
Springer
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
SPIN
2000
Springer
13 years 8 months ago
2000
Springer
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...