Search results for "wait-free"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Wim H. Hesselink	Progress Under Bounded Fairness.	Distributed Comput.	1999	DBLP DOI BibTeX RDF	Bounded fairness, Concurrent data object, Fault tolerance, Memory management, Client server architecture
18	James E. Burns, Rolando I. Cruz, Michael C. Loui	Generalized Agreement Between Concurrent Fail-Stop Processes.	WDAG	1993	DBLP DOI BibTeX RDF
15	Rachid Guerraoui, Eric Ruppert	Anonymous and fault-tolerant shared-memory computing.	Distributed Comput.	2007	DBLP DOI BibTeX RDF	Anonymous, Shared memory, Consensus, Timestamps, Snapshots
15	Rachid Guerraoui, Eric Ruppert	What Can Be Implemented Anonymously?	DISC	2005	DBLP DOI BibTeX RDF
13	Alysson Neves Bessani, Miguel Correia 0001, Joni da Silva Fraga, Lau Cheuk Lung	Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
13	Yehuda Afek, Nir Shavit, Moran Tzafrir	Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method.	DISC	2009	DBLP DOI BibTeX RDF	consistent state, fault-tolerance, atomic, snapshot, global state
13	Matthias Majuntke, Dan Dobre, Marco Serafini, Neeraj Suri	Abortable Fork-Linearizable Storage.	OPODIS	2009	DBLP DOI BibTeX RDF	Fork-linearizability, abortable objects, lock-freedom, shared memory, online collaboration
13	Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes	Multicore Scheduling for Lightweight Communicating Processes.	COORDINATION	2009	DBLP DOI BibTeX RDF
13	Björn B. Brandenburg, John M. Calandrino, Aaron Block, Hennadiy Leontyev, James H. Anderson	Real-Time Synchronization on Multiprocessors: To Block or Not to Block, to Suspend or Spin?	IEEE Real-Time and Embedded Technology and Applications Symposium	2008	DBLP DOI BibTeX RDF
13	Vijay A. Saraswat, Vivek Sarkar, Christoph von Praun	X10: concurrent programming for modern architectures.	PPoPP	2007	DBLP DOI BibTeX RDF	concurrent programming languages, fork-join parallelism, global shared memory, high performance computing languages, partitioned global address space languages, asynchrony, X10, hierarchical parallelism
13	Håkan Sundell, Philippas Tsigas	Scalable and lock-free concurrent dictionaries.	SAC	2004	DBLP DOI BibTeX RDF	concurrent, shared memory, dictionary, non-blocking
13	Jing Chen, Alan Burns 0001	Asynchronous data sharing in multiprocessor real-time systems using process consensus.	ECRTS	1998	DBLP DOI BibTeX RDF
13	James H. Anderson, Mark Moir	Universal Constructions for Large Objects.	WDAG	1995	DBLP DOI BibTeX RDF
10	Eli Gafni, Petr Kuznetsov	Brief announcement: on L-resilience, hitting sets, and colorless tasks.	PODC	2010	DBLP DOI BibTeX RDF	distributed tasks, l-resilience, weak solvability, wait-freedom
10	Maurice Herlihy, Sergio Rajsbaum	The topology of shared-memory adversaries.	PODC	2010	DBLP DOI BibTeX RDF	fault-tolerance, shared-memory, set agreement, combinatorial topology
10	Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers	Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.	ISAAC	2009	DBLP DOI BibTeX RDF
10	Aaron D. Sterling	Distributed Agreement in Tile Self-assembly.	DNA	2009	DBLP DOI BibTeX RDF
10	Panagiota Fatourou, Nikolaos D. Kallimanis	The RedBlue Adaptive Universal Constructions.	DISC	2009	DBLP DOI BibTeX RDF
10	Flavio Paiva Junqueira, Benjamin C. Reed	Brief Announcement Zab: A Practical Totally Ordered Broadcast Protocol.	DISC	2009	DBLP DOI BibTeX RDF
10	Eli Gafni, Petr Kuznetsov	The weakest failure detector for solving k-set agreement.	PODC	2009	DBLP DOI BibTeX RDF	BG-simulation, synchrony assumptions, weakest failure detector, failure detectors, k-set agreement
10	Flavio Paiva Junqueira, Benjamin C. Reed	The life and times of a zookeeper.	PODC	2009	DBLP DOI BibTeX RDF	fault-tolerance, distributed algorithms, coordination, replication, atomic broadcast
10	Flavio Paiva Junqueira, Benjamin C. Reed	The life and times of a zookeeper.	SPAA	2009	DBLP DOI BibTeX RDF	fault-tolerance, distributed algorithms, coordination, replication, atomic broadcast
10	Hagit Attiya, Keren Censor	Tight bounds for asynchronous randomized consensus.	J. ACM	2008	DBLP DOI BibTeX RDF	Distributed computing, lower bound, randomized algorithms, shared-memory, isoperimetric inequality
10	Martin T. Vechev, Eran Yahav	Deriving linearizable fine-grained concurrent objects.	PLDI	2008	DBLP DOI BibTeX RDF	algorithms, model checking, data structures, concurrency, linearizability
10	Juhua Pu, Zhang Xiong 0001, Xingwu Liu	The Impossibility of Boosting Resilience of Fully-connected Services for Solving Set-consensus Tasks.	IEEE SCC (2)	2008	DBLP DOI BibTeX RDF
10	Alysson Neves Bessani, Miguel Correia 0001, Joni da Silva Fraga, Lau Cheuk Lung	Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems.	NCA	2007	DBLP DOI BibTeX RDF
10	Faith Ellen, Panagiota Fatourou, Eric Ruppert	The Space Complexity of Unbounded Timestamps.	DISC	2007	DBLP DOI BibTeX RDF	lower bounds, anonymous, shared memory, timestamps
10	Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel	Constant-RMR implementations of CAS and other synchronization primitives using read and write operations.	PODC	2007	DBLP DOI BibTeX RDF	comparison primitives, shared memory, consensus, mutual exclusion, remote memory references
10	Eric Ruppert	The Anonymous Consensus Hierarchy and Naming Problems.	OPODIS	2007	DBLP DOI BibTeX RDF
10	Hagit Attiya, Keren Censor	Tight bounds for asynchronous randomized consensus.	STOC	2007	DBLP DOI BibTeX RDF	distributed computing, lower bound, randomized algorithms, shared-memory, isoperimetric inequality
10	Robert Colvin, Lindsay Groves, Victor Luchangco, Mark Moir	Formal Verification of a Lazy Concurrent List-Based Set Algorithm.	CAV	2006	DBLP DOI BibTeX RDF
10	Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers	Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.	ICDCN	2006	DBLP DOI BibTeX RDF
10	Marcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg	Brief Announcement: Abortable and Query-Abortable Objects.	DISC	2006	DBLP DOI BibTeX RDF
10	Rachid Guerraoui, Marko Vukolic	How fast can a very robust read be?	PODC	2006	DBLP DOI BibTeX RDF	arbitrary failures, optimal resilience, storage emulations, time-complexity
10	Shlomi Dolev, Ronen I. Kat, Elad Michael Schiller	When Consensus Meets Self-stabilization.	OPODIS	2006	DBLP DOI BibTeX RDF
10	Jean-Philippe Martin, Lorenzo Alvisi	A Framework for Dynamic Byzantine Storage.	DSN	2004	DBLP DOI BibTeX RDF
10	Eli Gafni	Group-Solvability.	DISC	2004	DBLP DOI BibTeX RDF
10	Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy	Condition-Based Protocols for Set Agreement Problems.	DISC	2002	DBLP DOI BibTeX RDF
10	Partha Dutta, Svend Frølund, Rachid Guerraoui, Bastian Pochon	An Efficient Universal Construction for Message-Passing Systems.	DISC	2002	DBLP DOI BibTeX RDF
10	Panagiota Fatourou, Faith E. Fich, Eric Ruppert	Space-optimal multi-writer snapshot objects are slow.	PODC	2002	DBLP DOI BibTeX RDF
10	Burkhard Englert, Eli Gafni	Fast Collect in the absence of contention.	ICDCS	2002	DBLP DOI BibTeX RDF
10	Patrick Keane, Mark Moir	A General Resource Allocation Synchronization Problem.	ICDCS	2001	DBLP DOI BibTeX RDF
10	James Aspnes	Fast deterministic consensus in a noisy environment.	PODC	2000	DBLP DOI BibTeX RDF
10	Eric Ruppert	Consensus Numbers of Transactional Objects.	DISC	1999	DBLP DOI BibTeX RDF
10	James Aspnes	Lower Bounds for Distributed Coin-Flipping and Randomized Consensus.	J. ACM	1998	DBLP DOI BibTeX RDF	randomization, consensus, impossibility
10	Mark Moir, Juan A. Garay	Fast, Long-Lived Renaming Improved and Simplified.	WDAG	1996	DBLP DOI BibTeX RDF
10	Hagit Attiya	Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract).	WDAG	1996	DBLP DOI BibTeX RDF
10	Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas	Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	sublinear complexity, deterministic protocol, memory location, Archimedean time assumption, computational complexity, protocols, distributed algorithms, time complexity, probabilistic algorithm, linear complexity, space complexity, atomic operation
10	Robert Cori, Shlomo Moran	Exotic Behaviour of Consensus Numbers.	WDAG	1994	DBLP DOI BibTeX RDF
10	Mark Moir, James H. Anderson	Fast, Long-Lived Renaming (Extended Abstract).	WDAG	1994	DBLP DOI BibTeX RDF
10	Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit	Atomic Snapshots of Shared Memory.	J. ACM	1993	DBLP DOI BibTeX RDF	consistent state, fault-tolerance, atomic, snapshot
10	Amos Israeli, Amnon Shaham, Asaf Shirazi	Linear-Time Snapshot Protocols for Unbalanced Systems.	WDAG	1993	DBLP DOI BibTeX RDF
10	Lefteris M. Kirousis, Andreas G. Veneris	Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations.	WDAG	1993	DBLP DOI BibTeX RDF
10	Hagit Attiya, Maurice Herlihy, Ophir Rachman	Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract).	WDAG	1992	DBLP DOI BibTeX RDF
10	David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang	Choice Coordination with Multiple Alternatives (Preliminary Version).	WDAG	1992	DBLP DOI BibTeX RDF
10	Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas	Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity.	WDAG	1991	DBLP DOI BibTeX RDF
10	Prasad Jayanti, Adarshpal S. Sethi, Errol L. Lloyd	Minimal Shared Information for Concurrent Reading and Writing.	WDAG	1991	DBLP DOI BibTeX RDF
10	Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas	Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps.	ICCI	1991	DBLP DOI BibTeX RDF
10	Kenneth J. Goldman	Highly Concurrent Logically Synchronous Multicast.	WDAG	1989	DBLP DOI BibTeX RDF
10	Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi	Atomic Multireader Register.	WDAG	1987	DBLP DOI BibTeX RDF	regular, atomic, Register, reader, writer, shared register