Sciweavers

72 search results - page 10 / 15
» Hierarchical Correctness Proofs for Distributed Algorithms
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
A calculus of functional BSP programs with projection
Bulk Synchronous Parallel ML (BSML) is an extension of the functional language Objective Caml to program Bulk Synchronous Parallel (BSP) algorithms. It is deterministic, deadlock ...
Frédéric Loulergue
IPPS
2010
IEEE
13 years 5 months ago
Optimizing RAID for long term data archives
We present new methods to extend data reliability of disks in RAID systems for applications like long term data archival. The proposed solutions extend existing algorithms to detec...
Henning Klein, Jörg Keller
PLDI
2012
ACM
11 years 9 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
FASE
2007
Springer
13 years 11 months ago
A Family of Distributed Deadlock Avoidance Protocols and Their Reachable State Spaces
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...
César Sánchez, Henny B. Sipma, Zohar...
SPAA
2000
ACM
13 years 11 months ago
DCAS-based concurrent deques
The computer industry is currently examining the use of strong synchronization operations such as double compareand-swap (DCAS) as a means of supporting non-blocking synchronizati...
Ole Agesen, David Detlefs, Christine H. Flood, Ale...