Search results for "Wait-Freedom"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Damien Imbs, Michel Raynal, Gadi Taubenfeld	On asymmetric progress conditions.	PODC	2010	DBLP DOI BibTeX RDF	fault-freedom, progress condition, liveness, process crash, wait-freedom, obstruction-freedom, asynchronous shared memory system, consensus number
82	Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi	Byzantine disk paxos: optimal resilience with byzantine shared memory.	Distributed Comput.	2006	DBLP DOI BibTeX RDF	T-tolerant object implementations, Lower bounds, Consensus, Byzantine failures, Wait freedom, Shared-memory emulations
62	Gadi Taubenfeld	Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms.	DISC	2007	DBLP DOI BibTeX RDF
50	Hagit Brit, Shlomo Moran	Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract).	PODC	1994	DBLP DOI BibTeX RDF
49	Maurice Herlihy, Victor Luchangco, Mark Moir	Obstruction-Free Synchronization: Double-Ended Queues as an Example.	ICDCS	2003	DBLP DOI BibTeX RDF
49	Srikanth Sastry, Scott M. Pike, Jennifer L. Welch	Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion.	SPAA	2010	DBLP DOI BibTeX RDF	contention managers, wait-freedom, obstruction-freedom
45	Erez Petrank, Madanlal Musuvathi, Bjarne Steensgaard	Progress guarantee for parallel programs via bounded lock-freedom.	PLDI	2009	DBLP DOI BibTeX RDF	bounded lock-freedom, lock-freedom, progress guarantees, model checking, parallel computation
44	Damien Imbs, Michel Raynal	The multiplicative power of consensus numbers.	PODC	2010	DBLP DOI BibTeX RDF	bg simulation, synchronization power, t-resilience, simulation, fault-tolerance, distributed computability, shared memory system, system model, wait-freedom, asynchronous processes, k-set agreement, consensus number, reduction algorithm, process crash failure
44	Gadi Taubenfeld	On the Computational Power of Shared Objects.	OPODIS	2009	DBLP DOI BibTeX RDF	power numbers, k-obstruction-freedom, wait-free hierarchy, power hierarchy, universality, Shared objects, wait-freedom, consensus numbers
43	Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov	The weakest failure detectors to boost obstruction-freedom.	Distributed Comput.	2008	DBLP DOI BibTeX RDF	Obstruction-free, Shared memory, Contention manager, Failure detector, Wait-free, Non-blocking
43	Mark Moir	Transparent Support for Wait-Free Transactions.	WDAG	1997	DBLP DOI BibTeX RDF
39	Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg	Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.	PODC	1994	DBLP DOI BibTeX RDF
39	Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit	Obstruction-Free Algorithms Can Be Practically Wait-Free.	DISC	2005	DBLP DOI BibTeX RDF
38	Ambuj K. Singh	An Axiomatization of Wait-Freedom and Low-Atomicity.	ICCI	1990	DBLP DOI BibTeX RDF
36	Philippe Stellwag, Alexander Ditter, Wolfgang Schröder-Preikschat	A wait-free queue for multiple enqueuers and multiple dequeuers using local preferences and pragmatic extensions.	SIES	2009	DBLP DOI BibTeX RDF
36	Hui Gao, Jan Friso Groote, Wim H. Hesselink	Almost Wait-Free Resizable Hashtable.	IPDPS	2004	DBLP DOI BibTeX RDF
36	Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi	Byzantine disk paxos: optimal resilience with byzantine shared memory.	PODC	2004	DBLP DOI BibTeX RDF	termination conditions, consensus, Byzantine failures, shared-memory emulations
36	Faith E. Fich, Maurice Herlihy, Nir Shavit	On the Space Complexity of Randomized Synchronization.	J. ACM	1998	DBLP DOI BibTeX RDF	lower bounds, consensus, space complexity
36	Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin	Separating lock-freedom from wait-freedom at every level of the consensus hierarchy.	J. Parallel Distributed Comput.	2022	DBLP DOI BibTeX RDF
36	Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin	Separating Lock-Freedom from Wait-Freedom.	PODC	2018	DBLP DOI BibTeX RDF
36	Oksana Denysyuk, Philipp Woelfel	Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability.	DISC	2015	DBLP DOI BibTeX RDF
36	Hagit Brit, Shlomo Moran	Wait-Freedom vs. Bounded-Freedom in Public Data Structures.	J. Univers. Comput. Sci.	1996	DBLP DOI BibTeX RDF
31	Brijesh Dongol	Formalising Progress Properties of Non-blocking Programs.	ICFEM	2006	DBLP DOI BibTeX RDF
31	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
31	Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev, Eran Yahav, Greta Yorsh	Verifying linearizability with hindsight.	PODC	2010	DBLP DOI BibTeX RDF	hindsight, linearizability, wait-freedom, optimistic concurrency
31	Eli Gafni	The extended BG-simulation and the characterization of t-resiliency.	STOC	2009	DBLP DOI BibTeX RDF	solvability, t-resiliency, decidability, symmetry breaking, wait-freedom, renaming
31	Srikanth Sastry, Scott M. Pike, Jennifer L. Welch	The weakest failure detector for wait-free dining under eventual weak exclusion.	SPAA	2009	DBLP DOI BibTeX RDF	mutual exclusion, failure detectors, wait-freedom, partial synchrony, dining philosophers
31	Scott M. Pike, Yantao Song, Srikanth Sastry	Wait-Free Dining Under Eventual Weak Exclusion.	ICDCN	2008	DBLP DOI BibTeX RDF	Failure Detectors, Wait-Freedom, Dining Philosophers
31	Yantao Song, Scott M. Pike	Eventually k-Bounded Wait-Free Distributed Daemons.	DSN	2007	DBLP DOI BibTeX RDF	self-stabilization, wait-freedom, daemons
31	Faith E. Fich, Danny Hendler, Nir Shavit	On the inherent weakness of conditional synchronization primitives.	PODC	2004	DBLP DOI BibTeX RDF	load-linked, store-conditional, test-and-set, lower bounds, compare-and-swap, wait-freedom, synchronization primitives
31	Sibsankar Haldar, Paul M. B. Vitányi	Bounded concurrent timestamp systems using vector clocks.	J. ACM	2002	DBLP DOI BibTeX RDF	Concurrent reading while writing, labeling and scan, nonatomic operation execution, operation execution, operation-read and write, regular and atomic, shared variable-safe, timestamp system, traceability, label, wait-freedom, vector clock
31	Prasad Jayanti	Robust wait-free hierarchies.	J. ACM	1997	DBLP DOI BibTeX RDF	synchronization, robustness, implementation, shared memory, hierarchy, MIMD, shared objects, wait-freedom, asynchronous computing
31	Michiko Inoue, Sen Moriya, Toshimitsu Masuzawa, Hideo Fujiwara	Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System.	WDAG	1997	DBLP DOI BibTeX RDF	shared-memory multi-processor system, napping fault, fault-tolerance, clock-synchronization, wait-freedom
31	Hagit Attiya, Amotz Bar-Noy, Danny Dolev	Sharing Memory Robustly in Message-Passing Systems.	J. ACM	1995	DBLP DOI BibTeX RDF	processor and link failures, fault-tolerance, message passing, shared memory, emulation, atomic registers, wait-freedom
31	Sibsankar Haldar, K. Vidyasankar	Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables.	J. ACM	1995	DBLP DOI BibTeX RDF	nonatomic operation execution, reader and writer, regular and atomic, shared variable-safe, wait-freedom
25	Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers	Universal constructions that ensure disjoint-access parallelism and wait-freedom.	Distributed Comput.	2016	DBLP DOI BibTeX RDF
25	Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov	Wait-freedom with advice.	Distributed Comput.	2015	DBLP DOI BibTeX RDF
25	Petr Kuznetsov, Srivatsan Ravi	On Partial Wait-Freedom in Transactional Memory.	ICDCN	2015	DBLP DOI BibTeX RDF
25	Petr Kuznetsov, Srivatsan Ravi	On Partial Wait-Freedom in Transactional Memory.	CoRR	2014	DBLP BibTeX RDF
25	Michel Raynal, Julien Stainer, Gadi Taubenfeld	Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties.	PODC	2014	DBLP DOI BibTeX RDF
25	Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers	Universal constructions that ensure disjoint-access parallelism and wait-freedom.	PODC	2012	DBLP DOI BibTeX RDF
25	Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov	Wait-freedom with advice.	PODC	2012	DBLP DOI BibTeX RDF
25	Damien Imbs, Michel Raynal	A liveness condition for concurrent objects: x-wait-freedom.	Concurr. Comput. Pract. Exp.	2011	DBLP DOI BibTeX RDF
25	Eli Gafni, Petr Kuznetsov	Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets.	ICDCN	2011	DBLP DOI BibTeX RDF
25	Damien Imbs, Michel Raynal	The x-Wait-Freedom Progress Condition.	Euro-Par (1)	2010	DBLP DOI BibTeX RDF
25	Marcos Kawazoe Aguilera, Sam Toueg	Timeliness-based wait-freedom: a gracefully degrading progress condition.	PODC	2008	DBLP DOI BibTeX RDF
25	Wai-Kau Lo	More on t-Resilience vs. Wait-Freedom (Extended Abstract).	PODC	1995	DBLP DOI BibTeX RDF
23	Alexey Gotsman, Byron Cook, Matthew J. Parkinson, Viktor Vafeiadis	Proving that non-blocking algorithms don't block.	POPL	2009	DBLP DOI BibTeX RDF	formal verification, concurrent programming, termination, liveness
23	Rachid Guerraoui, Thomas A. Henzinger, Barbara Jobstmann, Vasu Singh	Model checking transactional memories.	PLDI	2008	DBLP DOI BibTeX RDF	model checking, transactional memories
21	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
13	Dan Dobre, Matthias Majuntke, Marco Serafini, Neeraj Suri	Efficient Robust Storage Using Secret Tokens.	SSS	2009	DBLP DOI BibTeX RDF
13	Lisa Higham, Colette Johnen	Relationships between communication models in networks using atomic registers.	IPDPS	2006	DBLP DOI BibTeX RDF
13	Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger, Michael K. Reiter	Efficient Byzantine-Tolerant Erasure-Coded Storage.	DSN	2004	DBLP DOI BibTeX RDF
13	Ravi Rajwar, James R. Goodman	Transactional lock-free execution of lock-based programs.	ASPLOS	2002	DBLP DOI BibTeX RDF