Sciweavers

165 search results - page 23 / 33
» Safety-Liveness Exclusion in Distributed Computing
Sort
View
PPOPP
1993
ACM
15 years 3 months ago
Integrating Message-Passing and Shared-Memory: Early Experience
This paper discusses some of the issues involved in implementing a shared-address space programming model on large-scale, distributed-memory multiprocessors. While such a programm...
David A. Kranz, Kirk L. Johnson, Anant Agarwal, Jo...
PODC
1990
ACM
15 years 3 months ago
Composite Registers
We introduce a shared data object, called a composite register, that generalizes the notion of an atomic register. A composite register is an array-like shared data object that is...
James H. Anderson
PODC
1991
ACM
15 years 3 months ago
Resource Bounds for Self Stabilizing Message Driven Protocols
Abstract. Self-stabilizing message driven protocols are defined and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is deļ...
Shlomi Dolev, Amos Israeli, Shlomo Moran
EUROPAR
2010
Springer
15 years 18 days ago
Transactional Mutex Locks
Mutual exclusion locks limit concurrency but offer low latency. Software transactional memory (STM) typically has higher latency, but scales well. In this paper we propose transac...
Luke Dalessandro, David Dice, Michael L. Scott, Ni...
92
Voted
PPOPP
2009
ACM
15 years 6 months ago
NePalTM: design and implementation of nested parallelism for transactional memory systems
Abstract. Transactional memory (TM) promises to simplify construction of parallel applications by allowing programmers to reason about interactions between concurrently executing c...
Haris Volos, Adam Welc, Ali-Reza Adl-Tabatabai, Ta...