Sciweavers

603 search results - page 58 / 121
» concurrency 2010
Sort
View
PODC
2010
ACM
15 years 1 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
SSS
2010
Springer
103views Control Systems» more  SSS 2010»
14 years 8 months ago
A Provably Starvation-Free Distributed Directory Protocol
Abstract. This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests,...
Hagit Attiya, Vincent Gramoli, Alessia Milani
IFM
2010
Springer
113views Formal Methods» more  IFM 2010»
14 years 8 months ago
Translating Pi-Calculus into LOTOS NT
Process calculi supporting mobile communication, such as the π-calculus, are often seen as an evolution of classical value-passing calculi, in which communication between processe...
Radu Mateescu, Gwen Salaün
SPAA
2010
ACM
15 years 2 months ago
Flat combining and the synchronization-parallelism tradeoff
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
HPDC
2010
IEEE
14 years 11 months ago
A data transfer framework for large-scale science experiments
Modern scientific experiments can generate hundreds of gigabytes to terabytes or even petabytes of data that may furthermore be maintained in large numbers of relatively small fil...
Wantao Liu, Brian Tieman, Rajkumar Kettimuthu, Ian...