Communications of the ACM - Special section on computer architecture
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Efficient synchronization of multiprocessors with shared memory
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The elusive atomic register revisited
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing multi-reader atomic values from non-atomic values
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A protocol for wait-free, atomic, multi-reader shared variables
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing two-writer atomic registers
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Sticky bits and universality of consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Shared-memory vs. message-passing in an asynchronous distributed environment
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Fast randomized consensus using shared memory
Journal of Algorithms
A methodology for implementing highly concurrent data structures
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Concurrent set manipulation without locking
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The serializability of concurrent database updates
Journal of the ACM (JACM)
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent reading and writing
Communications of the ACM
Wait-free data structures in the asynchronous PRAM model
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Process coordination with fetch-and-increment
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
Randomized wait-free concurrent objects (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Lock-free garbage collection for multiprocessors
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Impossibility results for asynchronous PRAM (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computing with faulty shared memory
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Performance issues in non-blocking synchronization on shared-memory multiprocessors
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Designing synchronous algorithms for asynchronous processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Primitives for asynchronous list compression
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Low contention load balancing on large-scale multiprocessors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
Fast mutual exclusion for uniprocessors
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Atomic snapshots of shared memory
Journal of the ACM (JACM)
A concurrent copying garbage collector for languages that distinguish (im)mutable data
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Atomic snapshots in O(n log n) operations
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Resource bounds and combinations of consensus objects
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
On the robustness of Herlihy's hierarchy
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
A completeness theorem for a class of synchronization objects
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
On the space complexity of randomized synchronization
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
A method for implementing lock-free shared-data structures
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Using Smalltalk for wait-free implementation of highly-concurrent objects
ACM SIGPLAN OOPS Messenger
Wait-free k-set agreement is impossible: the topology of public knowledge
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A bounded first-in, first-enabled solution to the l-exclusion problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Are wait-free algorithms fast?
Journal of the ACM (JACM)
Diffracting trees (preliminary version)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
On testing cache-coherent shared memories
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Linear logic and permutation stacks—the Forth shall be first
ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers
Time bounds for mutual exclusion and related problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Time-adaptive algorithms for synchronization
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Delimiting the power of bounded size synchronization objects (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Coins, weights and contention in balancing networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Set consensus using arbitrary objects (preliminary version)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A gap theorem for consensus types extended abstract
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
On the use of registers in achieving wait-free consensus
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Consensus power makes (some) sense! (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Failure detectors and the wait-free hierarchy (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
More on t-resilience vs. wait-freedom (extended abstract)
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Universal constructions for multi-object operations
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Lock-free linked lists using compare-and-swap
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Lazy-writer multivalued registers
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Computing with faulty shared objects
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Synchronization and communication in the T3E multiprocessor
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
The power of multi-objects (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Universal operations: unary versus binary
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Real-time object sharing with minimal system support
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Space bounds for transactional synchronization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Real-time computing with lock-free shared objects
ACM Transactions on Computer Systems (TOCS)
Lower bounds for distributed coin-flipping and randomized consensus
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
All of us are smarter than any of us: wait-free hierarchies are not robust
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
On the power of shared object types to implement one-resilient Consensus
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Disentangling multi-object operations (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Towards a topological characterization of asynchronous complexity
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Practical implementations of non-blocking synchronization primitives
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The consensus hierarchy is not robust
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Space-optimal wait-free queues
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Disco: running commodity operating systems on scalable multiprocessors
ACM Transactions on Computer Systems (TOCS)
Disco: running commodity operating systems on scalable multiprocessors
Proceedings of the sixteenth ACM symposium on Operating systems principles
Contention in shared memory algorithms
Journal of the ACM (JACM)
Wait-free lazy-writer registers with eager readers
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Thread scheduling for multiprogrammed multiprocessors
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Synchronization mechanisms for SCRAMNet+ systems
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A lower bound on the local time complexity of universal constructions
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A time complexity lower bound for randomized implementations of some shared objects
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Consensus numbers of multi-objects
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A polylog time wait-free construction for closed objects
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The performance of work stealing in multiprogrammed environments (extended abstract)
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Lower bounds for distributed coin-flipping and randomized consensus
Journal of the ACM (JACM)
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
Constructing a Reliable Test&Set Bit
IEEE Transactions on Parallel and Distributed Systems
Compile/run-time support for threaded MPI execution on multiprogrammed shared memory machines
Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
ICS '99 Proceedings of the 13th international conference on Supercomputing
A Mechanically Checked Proof of a Multiprocessor Result via a Uniprocessor View
Formal Methods in System Design
Atomic heap transactions and fine-grain interrupts
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Universal Constructions for Large Objects
IEEE Transactions on Parallel and Distributed Systems
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Adaptive two-level thread management for fast MPI execution on shared memory machines
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Mapping irregular applications to DIVA, a PIM-based data-intensive architecture
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Adaptive and efficient mutual exclusion (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
X-ability: a theory of replication
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Tight bounds for k-set agreement
Journal of the ACM (JACM)
Program transformation and runtime support for threaded MPI execution on shared-memory machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementing E-Transactions with Asynchronous Replication
IEEE Transactions on Parallel and Distributed Systems
Lock-free scheduling of logical processes in parallel simulation
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Scalable queue-based spin locks with timeout
PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Synthesis of concurrent programs for an atomic read/write model of computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
On beyond registers: wait-free readable objects
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Improved implementations of binary universal operations
Journal of the ACM (JACM)
The GARF library of DSM consistency models
EW 6 Proceedings of the 6th workshop on ACM SIGOPS European workshop: Matching operating systems to application needs
Wait-free consensus with infinite arrivals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
High performance dynamic lock-free hash tables and list-based sets
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
Space-optimal multi-writer snapshot objects are slow
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
f-arrays: implementation and applications
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Non-blocking steal-half work queues
Proceedings of the twenty-first annual symposium on Principles of distributed computing
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
On name resolution in peer-to-peer networks
Proceedings of the second ACM international workshop on Principles of mobile computing
Transactional lock-free execution of lock-based programs
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Information Processing Letters
International Journal of Parallel Programming
Lock-Free Garbage Collection for Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Public data structures: counters as a special case
Theoretical Computer Science
Self-stabilization of wait-free shared memory objects
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Concurrent Reading and Writing with Mobile Agents
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Consensus Numbers of Transactional Objects
Proceedings of the 13th International Symposium on Distributed Computing
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Objects Shared by Byzantine Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A Pragmatic Implementation of Non-blocking Linked-Lists
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Improving Wait-Free Algorithms for Interprocess Communication in Embedded Real-Time Systems
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Even Better DCAS-Based Concurrent Deques
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
An Efficient Universal Construction for Message-Passing Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Randomized two-process wait-free test-and-set
Distributed Computing
Nonblocking k-compare-single-swap
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A tight time lower bound for space-optimal implementations of multi-writer snapshots
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algorithms adapting to point contention
Journal of the ACM (JACM)
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Local-spin Mutual Exclusion Using Fetch-and-\phi Primitives
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Operation-valency and the cost of coordination
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A work-optimal deterministic algorithm for the asynchronous certified write-all problem
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Software for multiprocessor networks on chip
Networks on chip
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Arbitration-free synchronization
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Scalable and lock-free concurrent dictionaries
Proceedings of the 2004 ACM symposium on Applied computing
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects
IEEE Transactions on Parallel and Distributed Systems
On bounding time and space for multiprocessor garbage collection
ACM SIGPLAN Notices - Best of PLDI 1979-1999
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
Scalable lock-free dynamic memory allocation
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
DCAS is not a silver bullet for nonblocking algorithm design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Bringing practical lock-free synchronization to 64-bit applications
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Lock-free linked lists and skip lists
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Lower bounds for adaptive collect and related objects
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the inherent weakness of conditional synchronization primitives
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
How fast can a distributed atomic read be?
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: a single enqueuer wait-free queue implementation
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Computing
Experience with safe manual memory-management in cyclone
Proceedings of the 4th international symposium on Memory management
Progress under bounded fairness
Distributed Computing
On the use of registers in achieving wait-free consensus
Distributed Computing
Randomized naming using wait-free shared variables
Distributed Computing
Adaptive Locks For Frequently Scheduled Tasks With Unpredictable Runtimes
LISA '97 Proceedings of the 11th USENIX conference on System administration
An algorithm for the asynchronous Write-All problem based on process collision
Distributed Computing
Long lived adaptive splitter and applications
Distributed Computing
An adaptive collect algorithm with applications
Distributed Computing
Asynchronous group mutual exclusion
Distributed Computing
On the power of shared object types to implement one-resilient Consensus
Distributed Computing
Wait-Free Reference Counting and Memory Management
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Wait-free concurrent memory management by create and read until deletion (CaRuD)
Distributed Computing
Objects shared by Byzantine processes
Distributed Computing
Nonblocking memory management support for dynamic-sized data structures
ACM Transactions on Computer Systems (TOCS)
Atomic snapshots using lattice agreement
Distributed Computing
Wait-free linearization with an assertional proof
Distributed Computing
Distributed Computing
Threads cannot be implemented as a library
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Static analysis of atomicity for programs with non-blocking synchronization
Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming
Fast and lock-free concurrent priority queues for multi-thread systems
Journal of Parallel and Distributed Computing
Distributed Computing
Naming symmetric processes using shared variables
Distributed Computing
Multi-writer composite registers
Distributed Computing
Distributed Computing
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
X10: an object-oriented approach to non-uniform cluster computing
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Concurrent clustered programming
CONCUR 2005 - Concurrency Theory
Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming
Using wait-free synchronization in the design of distributed applications
Future Generation Computer Systems
BTS: a Byzantine fault-tolerant tuple space
Proceedings of the 2006 ACM symposium on Applied computing
Lock-free dynamic hash tables with open addressing
Distributed Computing - Special issue: PODC 02
Active disk Paxos with infinitely many processes
Distributed Computing - Special issue: PODC 02
Common2 extended to stacks and unbounded concurrency
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
An O(1) RMRs leader election algorithm
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
How fast can a very robust read be?
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Synchronizing without locks is inherently expensive
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Journal of Parallel and Distributed Computing
Tight bounds for shared memory systems accessed by Byzantine processes
Distributed Computing - Special issue: DISC 03
Efficient adaptive collect using randomization
Distributed Computing - Special issue: DISC 04
On the inherent weakness of conditional primitives
Distributed Computing - Special issue: PODC 04
A general lock-free algorithm using compare-and-swap
Information and Computation
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Information Processing Letters
A generic local-spin fetch-and-φ-based mutual exclusion algorithm
Journal of Parallel and Distributed Computing
Adaptive timeliness of consensus in presence of crash and timing faults
Journal of Parallel and Distributed Computing
Self-tuning reactive diffracting trees
Journal of Parallel and Distributed Computing
The notion of a timed register and its application to indulgent synchronization
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
MetaTM/TxLinux: transactional memory for an operating system
Proceedings of the 34th annual international symposium on Computer architecture
Tight bounds for asynchronous randomized consensus
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the Respective Power of ◊P and ◊S to Solve One-Shot Agreement Problems
IEEE Transactions on Parallel and Distributed Systems
Pebble: a component-based operating system for embedded applications
WOES'99 Proceedings of the Workshop on Embedded Systems on Workshop on Embedded Systems
Experiences with locking in a NUMA multiprocessor operating system kernel
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Abortable and query-abortable objects and their efficient implementation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Efficient fork-linearizable access to untrusted shared memory
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Failure detectors are schedulers
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Low-overhead byzantine fault-tolerant storage
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
TxLinux: using and managing hardware transactional memory in an operating system
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Fast interrupt priority management in operating system kernels
moas'93 USENIX Symposium on USENIX Microkernels and Other Kernel Architectures Symposium - Volume 4
Time lower bounds for implementations of multi-writer snapshots
Journal of the ACM (JACM)
Performance of memory reclamation for lockless synchronization
Journal of Parallel and Distributed Computing
The collective memory of amnesic processes
ACM Transactions on Algorithms (TALG)
Implementing sequentially consistent programs on processor consistent platforms
Journal of Parallel and Distributed Computing
Trace-based Derivation of a Lock-Free Queue Algorithm
Electronic Notes in Theoretical Computer Science (ENTCS)
DepSpace: a byzantine fault-tolerant coordination service
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
Transactional memory for smalltalk
ICDL '07 Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007
Distributed computing and the multicore revolution
ACM SIGACT News
Is the optimism in optimistic concurrency warranted?
HOTOS'07 Proceedings of the 11th USENIX workshop on Hot topics in operating systems
The gap in circumventing the impossibility of consensus
Journal of Computer and System Sciences
Model checking transactional memories
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Lock-free deques and doubly linked lists
Journal of Parallel and Distributed Computing
Combinable memory-block transactions
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On obstruction-free transactions
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Comparing communication primitives via their relative expressive power
Information and Computation
Sharing is harder than agreeing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Timeliness-based wait-freedom: a gracefully degrading progress condition
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Lower bounds for randomized consensus under a weak adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Randomized consensus in expected O(n log n) individual work
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Asynchronous exclusive selection
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Wait-free programming for general purpose computations on graphics processors
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
Transactional memory in a dynamic language
Computer Languages, Systems and Structures
Practical, Fast and Simple Concurrent FIFO Queues Using Single Word Synchronization Primitives
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Toward Efficient Support for Multithreaded MPI Communication
Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Optimistic Erasure-Coded Distributed Storage
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
The Synchronization Power of Coalesced Memory Accesses
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Optimizing Threshold Protocols in Adversarial Structures
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Locks Considered Harmful: A Look at Non-traditional Synchronization
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
A general characterization of indulgence
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Critical sections: re-emerging scalability concerns for database storage engines
Proceedings of the 4th international workshop on Data management on new hardware
Proving that non-blocking algorithms don't block
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantics of progress in lock-based transactional memory
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On the Time-Complexity of Robust and Amnesic Storage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Approximate shared-memory counting despite a strong adversary
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Fork sequential consistency is blocking
Information Processing Letters
Preliminary results on nb-feb, a synchronization primitive for parallel programming
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Communications of the ACM - Security in the Browser
From adaptive renaming to set agreement
Theoretical Computer Science
Proceedings of the Second Workshop on Isolation and Integration in Embedded Systems
A note on atomicity: Boosting Test&Set to solve consensus
Information Processing Letters
Attention driven visual processing for an interactive dialog robot
Proceedings of the 2009 ACM symposium on Applied Computing
Low-latency access to robust amnesic storage
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Classifying rendezvous tasks of arbitrary dimension
Theoretical Computer Science
Non-blocking Array-Based Algorithms for Stacks and Queues
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
The complexity of obstruction-free implementations
Journal of the ACM (JACM)
Progress guarantee for parallel programs via bounded lock-freedom
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Implementing AUTOSAR scheduling and resource management on an embedded SMT processor
Proceedings of th 12th International Workshop on Software and Compilers for Embedded Systems
Non-blocking programming on multi-core graphics processors: (extended asbtract)
ACM SIGARCH Computer Architecture News
NOBLE: non-blocking programming support via lock-free shared abstract data types
ACM SIGARCH Computer Architecture News
Multicore Scheduling for Lightweight Communicating Processes
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Transactional Memory: Glimmer of a Theory
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Proceedings of the 28th ACM symposium on Principles of distributed computing
The weakest failure detector for wait-free dining under eventual weak exclusion
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A concurrent dynamic analysis framework for multicore hardware
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Theoretical Computer Science
A scalable lock-free stack algorithm
Journal of Parallel and Distributed Computing
Efficient Robust Storage Using Secret Tokens
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
NB-FEB: A Universal Scalable Easy-to-Use Synchronization Primitive for Manycore Architectures
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Abortable Fork-Linearizable Storage
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On the Computational Power of Shared Objects
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
DCAS-based concurrent deques supporting bulk allocation
DCAS-based concurrent deques supporting bulk allocation
Transient blocking synchronization
Transient blocking synchronization
Supporting per-processor local-allocation buffers using multi-processor restartable critical sections
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Using wait-free synchronization in the design of distributed applications
Future Generation Computer Systems
Combining shared-coin algorithms
Journal of Parallel and Distributed Computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Approximate shared-memory counting despite a strong adversary
ACM Transactions on Algorithms (TALG)
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
Decoupling contention management from scheduling
Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems
Verifying safety properties of concurrent heap-manipulating programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A general characterization of indulgence
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Revisiting the impossibility for boosting service resilience
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
The multicore revolution: the challenges for theory
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
N-consensus is the second strongest object for N + 1 processes
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
The anonymous consensus hierarchy and naming problems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
On the probabilistic omission adversary
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Narrowing power vs. efficiency in synchronous set agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Highly-concurrent multi-word synchronization
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Wait-free dining under eventual weak exclusion
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Dissecting distributed computations
Future directions in distributed computing
Simplifying concurrent algorithms by exploiting hardware transactional memory
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A universal construction for wait-free transaction friendly data structures
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Interrupting snapshots and the Java™ size() method
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Tight group renaming on groups of size g is equivalent to g-consensus
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The RedBlue adaptive universal constructions
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Help when needed, but no more: efficient read/write partial snapshot
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Contention-sensitive data structures and algorithms
DISC'09 Proceedings of the 23rd international conference on Distributed computing
At-most-once semantics in asynchronous shared memory
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement zab: a practical totally ordered broadcast protocol
DISC'09 Proceedings of the 23rd international conference on Distributed computing
The inherent complexity of transactional memory and what to do about it
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On asymmetric progress conditions
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Non-blocking binary search trees
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: locally-accessible implementations for distributed shared memory multiprocessors
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Hardware/software support for adaptive work-stealing in on-chip multiprocessor
Journal of Systems Architecture: the EUROMICRO Journal
Parallel image thinning through topological operators on shared memory parallel machines
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Journal of Parallel and Distributed Computing
A method for analysis and solution of scalability bottleneck in DBMS
Proceedings of the 2010 Symposium on Information and Communication Technology
ZooKeeper: wait-free coordination for internet-scale systems
USENIXATC'10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference
Weak consistency as a last resort
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
Simpler backward simulation proofs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Instrumentation and sampling strategies for cooperative concurrency bug isolation
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Distributed computing: a Glimmer of a theory
Algorithms and theory of computation handbook
Embedding languages without breaking tools
ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Reasoning about optimistic concurrency using a program logic for history
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
The x-wait-freedom progress condition
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
The computational structure of progress conditions
DISC'10 Proceedings of the 24th international conference on Distributed computing
Making lockless synchronization fast: performance implications of memory reclamation
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Relationships between communication models in networks using atomic registers
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An analysis of Linux scalability to many cores
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On adaptive renaming under eventually limited contention
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
An intuitionistic epistemic logic for sequential consistency on shared memory
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Cache-aware lock-free queues for multiple producers/consumers and weak memory consistency
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
An adaptive technique for constructing robust and high-throughput shared objects
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Lock-free and scalable multi-version software transactional memory
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Wait-free queues with multiple enqueuers and dequeuers
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
A wait-free NCAS library for parallel applications with timing constraints
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Invited paper: the inherent complexity of transactional memory and what to do about it
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Locality-conscious lock-free linked lists
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Relating L-resilience and wait-freedom via hitting sets
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
An $O(1)$ RMRs Leader Election Algorithm
SIAM Journal on Computing
Distributed agreement in tile self-assembly
Natural Computing: an international journal
Analysis and performance results of computing betweenness centrality on IBM Cyclops64
The Journal of Supercomputing
The impossibility of boosting distributed service resilience
Information and Computation
Distributed decision problems: the locality angle
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Fast checkpoint recovery algorithms for frequently consistent applications
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A highly-efficient wait-free universal construction
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A lock-free algorithm for concurrent bags
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Linearizable implementations do not suffice for randomized distributed computation
Proceedings of the forty-third annual ACM symposium on Theory of computing
The complexity of robust atomic storage
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A complexity separation between the cache-coherent and distributed shared memory models
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
From bounded to unbounded concurrency objects and back
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fork-consistent constructions from registers
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Performance driven distributed scheduling of parallel hybrid computations
Theoretical Computer Science
On the performance of distributed lock-based synchronization?
ACM SIGOPS Operating Systems Review
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
A survey on some recent advances in shared memory models
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Multi-writer regular registers in dynamic distributed systems with byzantine failures
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Looking for efficient implementations of concurrent objects
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Real-time wait-free queues using micro-transactions
Proceedings of the 9th International Workshop on Java Technologies for Real-Time and Embedded Systems
Strict serializability is harmless: a new architecture for enterprise applications
Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion
A non-topological proof for the impossibility of k-set agreement
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Help when needed, but no more: Efficient read/write partial snapshot
Journal of Parallel and Distributed Computing
Fast and scalable rendezvousing
DISC'11 Proceedings of the 25th international conference on Distributed computing
Sub-logarithmic test-and-set against aweak adversary
DISC'11 Proceedings of the 25th international conference on Distributed computing
Fast Access to Distributed Atomic Memory
SIAM Journal on Computing
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
SIAM Journal on Computing
In search of the holy grail: looking for the weakest failure detector for wait-free set agreement
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Renaming with k-set-consensus: an optimal algorithm into n + k - 1 slots
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
When consensus meets self-stabilization
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Simultaneous consensus tasks: a tighter characterization of set-consensus
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Adapting to point contention with long-lived safe agreement
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Efficiently implementing LL/SC objects shared by an unknown number of processes
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Preemption adaptivity in time-published queue-based spin locks
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
The notion of veto number for distributed agreement problems
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Allocating memory in a lock-free manner
ESA'05 Proceedings of the 13th annual European conference on Algorithms
How hard is it to take a snapshot?
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Logarithmic-time single deleter, multiple inserter wait-free queues and stacks
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A practical single-register wait-free mutual exclusion algorithm on asynchronous networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Competitive freshness algorithms for wait-free data objects
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Bounded model checking of concurrent data types on relaxed memory models: a case study
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Built-in coloring for highly-concurrent doubly-linked lists
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Less is more: consensus gaps between restricted and unrestricted objects
DISC'06 Proceedings of the 20th international conference on Distributed Computing
One-step consensus solvability
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
The weakest failure detectors to boost obstruction-freedom
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Constructing shared objects that are both robust and high-throughput
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Brief announcement: abortable and query-abortable objects
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Lock-free and practical doubly linked list-based deques using single-word compare-and-swap
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
A methodology for creating fast wait-free data structures
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Revisiting the combining synchronization technique
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Lock-Free parallel algorithms: an experimental study
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
An improved algorithm for adaptive condition-based consensus
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
On conspiracies and hyperfairness in distributed computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Obstruction-Free algorithms can be practically wait-free
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Computing with reads and writes in the absence of step contention
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Restricted stack implementations
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Time and space lower bounds for implementations using k-CAS
DISC'05 Proceedings of the 19th international conference on Distributed Computing
(Almost) all objects are universal in message passing systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
What can be implemented anonymously?
DISC'05 Proceedings of the 19th international conference on Distributed Computing
A lazy concurrent list-based set algorithm
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Efficiently implementing a large number of LL/SC objects
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Multicore scheduling for lightweight communicating processes
Science of Computer Programming
The committee decision problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Fork-Consistent constructions from registers
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
A dynamic elimination-combining stack algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Towards a universal construction for transaction-based multiprocess programs
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Solving the at-most-once problem with nearly optimal effectiveness
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
On the implementation of concurrent objects
Dependable and Historic Computing
Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Can parallel data structures rely on automatic memory managers?
Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
The renaming problem in shared memory systems: An introduction
Computer Science Review
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
On the cost of composing shared-memory algorithms
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
On the liveness of transactional memory
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Universal constructions that ensure disjoint-access parallelism and wait-freedom
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
A closer look at fault tolerance
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Dynamic reconfiguration of primary/backup clusters
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Increasing the power of the iterated immediate snapshot model with failure detectors
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
A low-overhead dedicated execution support for stream applications on shared-memory cmp
Proceedings of the tenth ACM international conference on Embedded software
From unreliable objects to reliable objects: the case of atomic registers and consensus
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
A subjective visit to selected topics in distributed computing
DISC'07 Proceedings of the 21st international conference on Distributed Computing
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Efficient transformations of obstruction-free algorithms into non-blocking algorithms
DISC'07 Proceedings of the 21st international conference on Distributed Computing
From a store-collect object and Ω to efficient asynchronous consensus
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
Computability in distributed computing: a Tutorial
ACM SIGACT News
DISC'12 Proceedings of the 26th international conference on Distributed Computing
The strong at-most-once problem
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Fast RMWs for TSO: semantics and implementation
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Nonblocking algorithms and scalable multicore programming
Communications of the ACM
Proving the correctness of nonblocking data structures
Communications of the ACM
On deterministic abortable objects
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Drop the anchor: lightweight memory management for non-blocking data structures
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Avoiding disruptive failovers in transaction processing systems with multiple active nodes
Journal of Parallel and Distributed Computing
Proving the Correctness of Nonblocking Data Structures
Queue - Concurrency
Nonblocking Algorithms and Scalable Multicore Programming
Queue - Concurrency
Towards a complexity theory for local distributed computing
Journal of the ACM (JACM)
The balancing act of choosing nonblocking features
Communications of the ACM
Using simulation to explore distributed key-value stores for extreme-scale system services
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Scalable SIMD-parallel memory allocation for many-core machines
The Journal of Supercomputing
Effective use of non-blocking data structures in a deduplication application
Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity
The Balancing Act of Choosing Nonblocking Features
Queue - Development
Towards a universal construction for transaction-based multiprocess programs
Theoretical Computer Science
PoWerStore: proofs of writing for efficient and robust storage
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Everything you always wanted to know about synchronization but were afraid to ask
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
On the power of breakable objects
Theoretical Computer Science
Characterizing progress properties of concurrent objects via contextual refinements
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hugh: a semantically aware universal construction for transactional memory systems
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Lightweight contention management for efficient compare-and-swap operations
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Native actors: a scalable software platform for distributed, heterogeneous environments
Proceedings of the 2013 workshop on Programming based on actors, agents, and decentralized control
Fence-free work stealing on bounded TSO processors
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
Lock-free protected types for real-time ada
ACM SIGAda Ada Letters
Notions of aliasing and ownership
Aliasing in Object-Oriented Programming
Fast concurrent lock-free binary search trees
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
A non-topological proof for the impossibility of k-set agreement
Theoretical Computer Science
Theoretical Computer Science
Computing with infinitely many processes
Information and Computation
Eliminating unscalable communication in transaction processing
The VLDB Journal — The International Journal on Very Large Data Bases
A survey of support for structured communication in concurrency control models
Journal of Parallel and Distributed Computing
Quantitative Reasoning for Proving Lock-Freedom
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.06 |
A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another lies at the heart of much recent work in concurrent algorithms, concurrent data structures, and multiprocessor architectures. First, we introduce a simple and general technique, based on reduction to a concensus protocol, for proving statements of the form, “there is no wait-free implementation of X by Y.” We derive a hierarchy of objects such that no object at one level has a wait-free implementation in terms of objects at lower levels. In particular, we show that atomic read/write registers, which have been the focus of much recent attention, are at the bottom of the hierarchy: thay cannot be used to construct wait-free implementations of many simple and familiar data types. Moreover, classical synchronization primitives such astest&set and fetch&add, while more powerful than read and write, are also computationally weak, as are the standard message-passing primitives. Second, nevertheless, we show that there do exist simple universal objects from which one can construct a wait-free implementation of any sequential object.