Sciweavers

SPAA
2009
ACM
15 years 2 days ago
Remote storage with byzantine servers
Marcos Kawazoe Aguilera, Ram Swaminathan
SPAA
2009
ACM
15 years 2 days ago
On avoiding spare aborts in transactional memory
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
Idit Keidar, Dmitri Perelman
SPAA
2009
ACM
15 years 2 days ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
SPAA
2009
ACM
15 years 2 days ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
SPAA
2009
ACM
15 years 2 days ago
Inherent limitations on disjoint-access parallel implementations of transactional memory
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can b...
Hagit Attiya, Eshcar Hillel, Alessia Milani
SPAA
2009
ACM
15 years 2 days ago
Reducers and other Cilk++ hyperobjects
Matteo Frigo, Pablo Halpern, Charles E. Leiserson,...