Sciweavers

40 search results - page 1 / 8
» Computing with Reads and Writes in the Absence of Step Conte...
Sort
View
WDAG
2005
Springer
102views Algorithms» more  WDAG 2005»
13 years 10 months ago
Computing with Reads and Writes in the Absence of Step Contention
Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
13 years 4 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
ICDCS
2002
IEEE
13 years 9 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
HPCA
2012
IEEE
12 years 13 days ago
Staged Reads: Mitigating the impact of DRAM writes on DRAM reads
Main memory latencies have always been a concern for system performance. Given that reads are on the critical path for CPU progress, reads must be prioritized over writes. However...
Niladrish Chatterjee, Naveen Muralimanohar, Rajeev...
DSN
2006
IEEE
13 years 8 months ago
Lucky Read/Write Access to Robust Atomic Storage
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchr...
Rachid Guerraoui, Ron R. Levy, Marko Vukolic