Sciweavers

2870 search results - page 463 / 574
» Synchronization of multi-agent systems
Sort
View
WDAG
2010
Springer
196views Algorithms» more  WDAG 2010»
13 years 8 months ago
Brief Announcement: Failure Detectors Encapsulate Fairness
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...
Scott M. Pike, Srikanth Sastry, Jennifer L. Welch
PPOPP
2009
ACM
14 years 10 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
SPAA
2009
ACM
14 years 10 months ago
Scalable reader-writer locks
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
Yossi Lev, Victor Luchangco, Marek Olszewski
ICFP
2005
ACM
14 years 10 months ago
AtomCaml: first-class atomicity via rollback
We have designed, implemented, and evaluated AtomCaml, an extension to Objective Caml that provides a synchronization primitive for atomic (transactional) execution of code. A fir...
Michael F. Ringenburg, Dan Grossman
PPOPP
2010
ACM
14 years 7 months ago
Is transactional programming actually easier?
Chip multi-processors (CMPs) have become ubiquitous, while tools that ease concurrent programming have not. The promise of increased performance for all applications through ever ...
Christopher J. Rossbach, Owen S. Hofmann, Emmett W...