Sciweavers

40 search results - page 3 / 8
» Computing with Reads and Writes in the Absence of Step Conte...
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 6 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
NSDI
2008
13 years 8 months ago
UsenetDHT: A Low-Overhead Design for Usenet
Usenet is a popular distributed messaging and file sharing service: servers in Usenet flood articles over an overlay network to fully replicate articles across all servers. Howeve...
Emil Sit, Robert Morris, M. Frans Kaashoek
SPAA
1997
ACM
13 years 10 months ago
Fine-Grain Multithreading with the EM-X Multiprocessor
- Multithreading aims to tolerate latency by overlapping communication with computation. This report explicates the multithreading capabilities of the EM-X distributed-memory multi...
Andrew Sohn, Yuetsu Kodama, Jui Ku, Mitsuhisa Sato...
SIGMOD
2010
ACM
207views Database» more  SIGMOD 2010»
13 years 11 months ago
Automatic contention detection and amelioration for data-intensive operations
To take full advantage of the parallelism offered by a multicore machine, one must write parallel code. Writing parallel code is difficult. Even when one writes correct code, the...
John Cieslewicz, Kenneth A. Ross, Kyoho Satsumi, Y...
ICDCS
2007
IEEE
14 years 17 days ago
A High Throughput Atomic Storage Algorithm
This paper presents an algorithm to ensure the atomicity of a distributed storage that can be read and written by any number of clients. In failure-free and synchronous situations...
Rachid Guerraoui, Dejan Kostic, Ron R. Levy, Vivie...