822 search results - page 45 / 165 » Contention in shared memory algorithms |
OOPSLA
2010
Springer
13 years 7 months ago
2010
Springer
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
HIPC
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
EUROPAR
2005
Springer
14 years 2 months ago
2005
Springer
A style for programming problems from matrix algebra is developed with a familiar example and new tools, yielding high performance with a couple of surprising exceptions. The under...
WDAG
2001
Springer
14 years 1 months ago
2001
Springer
Distributed queuing is a fundamental coordination problem, arising in a variety of applications, including distributed shared memory, distributed directories, and totally ordered ...
APLAS
2009
ACM
14 years 3 months ago
2009
ACM
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...