Sciweavers

9 search results - page 2 / 2
» Cooperative asynchronous update of shared memory
Sort
View
PPOPP
2006
ACM
13 years 11 months ago
Exploiting distributed version concurrency in a transactional memory cluster
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
Kaloian Manassiev, Madalin Mihailescu, Cristiana A...
ICDCS
2002
IEEE
13 years 10 months ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
MIDDLEWARE
2007
Springer
13 years 11 months ago
XenSocket: A High-Throughput Interdomain Transport for Virtual Machines
This paper presents the design and implementation of XenSocket, a UNIX-domain-socket-like construct for high-throughput interdomain (VM-to-VM) communication on the same system. The...
Xiaolan Zhang, Suzanne McIntosh, Pankaj Rohatgi, J...
PPL
2007
86views more  PPL 2007»
13 years 4 months ago
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
Chryssis Georgiou, Alexander Russell, Alexander A....