Sciweavers

6808 search results - page 257 / 1362
» Distributed Concurrency Control
Sort
View
PPOPP
2005
ACM
16 years 6 days ago
Revocable locks for non-blocking programming
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
Tim Harris, Keir Fraser
CONCUR
2000
Springer
15 years 11 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
CONCUR
2000
Springer
15 years 11 months ago
Process Spaces
This paper introduces process spaces, a unified theory of interacting systems. The trait, abstract executions, leads to a simple and general set formalism. For concurrent systems ...
Radu Negulescu
158
Voted
IPPS
1999
IEEE
15 years 11 months ago
Hiding Communication Latency in Reconfigurable Message-Passing Environments
Communication overhead is one of the most important factors affecting the performance of message passing multicomputers. We present evidence (through the analysis of several paral...
Ahmad Afsahi, Nikitas J. Dimopoulos
IPPS
1998
IEEE
15 years 11 months ago
Hiding Communication Latency in Data Parallel Applications
Interprocessor communication times can be a significant fraction of the overall execution time required for data parallel applications. Large communication to computation ratios o...
Vivek Garg, David E. Schimmel