33 search results - page 6 / 7 » Heaps and Stacks in Distributed Shared Memory |
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
CONCUR
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
PSC
1992
13 years 9 months ago
1992
Abstract. This paper describes an implementation technique for Multilisp's future construct aimed at large shared-memory multiprocessors. The technique is a variant of lazy ta...
SPAA
1990
ACM
13 years 9 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
IEEECIT
2009
IEEE
13 years 11 months ago
2009
IEEE
—With virtual machine technology, distributed services deployed in multiple cooperative virtual machines, such as multi-tier web services, may reside on one physical machine. Thi...