|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 519 occurrences of 209 keywords
|
|
|
Results
Found 460 publication records. Showing 460 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
31 | Soma Chaudhuri, Mark R. Tuttle |
Fast Increment Registers. |
WDAG |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Maurice Herlihy |
A Methodology for Implementing Highly Concurrent Data Structures. |
PPoPP |
1990 |
DBLP DOI BibTeX RDF |
|
29 | Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi |
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions. |
DISC |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Thomas F. Wenisch, Anastassia Ailamaki, Babak Falsafi, Andreas Moshovos |
Mechanisms for store-wait-free multiprocessors. |
ISCA |
2007 |
DBLP DOI BibTeX RDF |
store buffer design, memory consistency models |
29 | Stephen Paynter, Neil Henderson, James M. Armstrong |
Metastability in Asynchronous Wait-Free Protocols. |
IEEE Trans. Computers |
2006 |
DBLP DOI BibTeX RDF |
asynchronous operation, model checking, formal models, Protocol verification |
29 | Scott M. Pike, Yantao Song, Kaustav Ghoshal |
Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion. |
SSS |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Achour Mostéfaoui, Michel Raynal, Corentin Travers |
Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Matei David |
A Single-Enqueuer Wait-Free Queue Implementation. |
DISC |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Paul M. B. Vitányi |
Simple Wait-Free Multireader Registers. |
DISC |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Hagit Attiya, Zvi Avidor |
Wait-Free n-Set Consensus When Inputs Are Restricted. |
DISC |
2002 |
DBLP DOI BibTeX RDF |
|
29 | James Aspnes, Gauri Shah, Jatin Shah |
Wait-free consensus with infinite arrivals. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Maurice Herlihy, Sergio Rajsbaum |
A Wait-Free Classification of Loop Agreement Tasks. |
DISC |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Eric Goubault |
Optimal Implementation of Wait-Free Binary Relations. |
TAPSOFT |
1997 |
DBLP DOI BibTeX RDF |
|
29 | James H. Anderson, Mark Moir |
Towards a Necessary and Sufficient Condition for Wait-free Synchronization (Extended Abstract). |
WDAG |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Amos Israeli, Lihu Rappoport |
Efficient Wait-Free Implementation of a Concurrent Priority Queue. |
WDAG |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitányi |
Wait-free Test-and-Set (Extended Abstract). |
WDAG |
1992 |
DBLP DOI BibTeX RDF |
|
29 | James H. Anderson, Bojan Groselj |
Pseudo Read-Modify-Write Operations: Bounded Wait-Free Implementations (Extended Abstract). |
WDAG |
1991 |
DBLP DOI BibTeX RDF |
|
29 | Ming Li 0001, Paul M. B. Vitányi |
How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version). |
ICALP |
1989 |
DBLP DOI BibTeX RDF |
|
25 | Maged M. Michael |
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. |
PODC |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov |
The Weakest Failure Detectors to Boost Obstruction-Freedom. |
DISC |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Mark Moir |
Laziness pays! using lazy synchronization mechanisms to improve non-blocking constructions. |
PODC |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Gadi Taubenfeld |
Contention-Sensitive Data Structures and Algorithms. |
DISC |
2009 |
DBLP DOI BibTeX RDF |
Contention-sensitive, shortcut code, disable-free, prevention-free, k-obstruction-free, synchronization, locks, wait-free, starvation, livelock |
24 | Antonio Fernández Anta, Sergio Rajsbaum, Corentin Travers |
Brief announcement: weakest failure detectors via an egg-laying simulation. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
distributed computing, lower bounds, shared memory, failure detectors, wait-free |
24 | 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 |
24 | Andreas Larsson, Anders Gidenstam, Phuong Hoai Ha, Marina Papatriantafilou, Philippas Tsigas |
Multiword atomic read/write registers on multiprocessor systems. |
ACM J. Exp. Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
synchronization, wait-free, Atomic register |
24 | Michel Raynal |
Synchronization is Coming Back, But is it the Same? |
AINA |
2008 |
DBLP DOI BibTeX RDF |
Adaptive renaming, Atomic snapshot, Test & set, t-Resilience, Shared memory, Reduction, Asynchronous system, Process crash, Atomic register, Set agreement, Wait-free algorithm |
24 | Hagit Attiya, Rachid Guerraoui, Eric Ruppert |
Partial snapshot objects. |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
active set, shared-memory, asynchronous, wait-free, snapshot |
24 | Faith Ellen, Panagiota Fatourou, Eric Ruppert |
Time lower bounds for implementations of multi-writer snapshots. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Distributed computing, lower bound, shared memory, wait-free, snapshot, registers |
24 | Panagiota Fatourou, Nikolaos D. Kallimanis |
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
linearizable objects, single-scanner, wait-free implementations, distributed algorithms, asynchronous, snapshots, compare-and-swap (CAS) |
24 | Michel Raynal, Gadi Taubenfeld |
The notion of a timed register and its application to indulgent synchronization. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
test&set, timing assumption, universal object, wait-free implementation, consensus, mutual exclusion, timing constraint, contention manager, process crash, simplicity, atomic register, renaming, concurrent object, asynchronous shared memory system |
24 | Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert |
Time-space tradeoffs for implementations of snapshots. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
anonymous processes, distributed computing, lower bound, shared memory, wait-free, snapshot, time-space tradeoff |
24 | Hui Gao, Jan Friso Groote, Wim H. Hesselink |
Lock-free dynamic hash tables with open addressing. |
Distributed Comput. |
2005 |
DBLP DOI BibTeX RDF |
Distributed algorithms, Wait-free, Lock-free, Hash tables |
24 | Prasad Jayanti |
An optimal multi-writer snapshot algorithm. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
fault-tolerant, asynchronous, wait-free, snapshot, lock-free, concurrent algorithm |
24 | Wim H. Hesselink |
An assertional proof for a construction of an atomic variable. |
Formal Aspects Comput. |
2004 |
DBLP DOI BibTeX RDF |
Invariant, Atomicity, Wait-free, Safeness |
24 | Stephen Paynter, Neil Henderson, James M. Armstrong |
Ramifications of metastability in bit variables explored via Simpson's 4-slot mechanism. |
Formal Aspects Comput. |
2004 |
DBLP DOI BibTeX RDF |
Simpsons 4-slot ACM, Atomic, Wait-free, Metastability, Safe, Freshness |
24 | Norman Scaife, Paul Caspi |
Integrating Model-Based Design and Preemptive Scheduling in Mixed Time- and Event-Triggered Systems. |
ECRTS |
2004 |
DBLP DOI BibTeX RDF |
wait-free communication, double buffers, model-based design, synchrony, preemptive scheduling, fixed priority |
24 | Philippe Raipin Parvédy, Michel Raynal |
Reliable Compare & Swap for Fault-Tolerant Synchronization. |
WORDS |
2003 |
DBLP DOI BibTeX RDF |
Compare&Swap, Fault-Tolerance, Graceful Degradation, Crash Failure, Wait-free Synchronization, Omission Failure |
24 | Yehuda Afek, Gideon Stupp, Dan Touitou |
Long lived adaptive splitter and applications. |
Distributed Comput. |
2002 |
DBLP DOI BibTeX RDF |
Read/write shared memory, Long-lived, Mutual exclusion, Contention, Adaptive algorithms, Wait-free, Renaming |
24 | Michel Raynal |
An Introduction to the Renaming Problem. |
PRDC |
2002 |
DBLP DOI BibTeX RDF |
Renaming problem, Fault-tolerance, Concurrency, Shared memory system, Process crash, Message passing system, Atomic register, Wait-free computation |
24 | Danny Hendler, Nir Shavit |
Work dealing. |
SPAA |
2002 |
DBLP DOI BibTeX RDF |
load-balancing, distributed, wait-free |
24 | Jan Friso Groote, Wim H. Hesselink, Sjouke Mauw, Rogier Vermeulen |
An algorithm for the asynchronous Write-All problem based on process collision. |
Distributed Comput. |
2001 |
DBLP DOI BibTeX RDF |
Write-all problem, Distributed algorithms, Dynamic load balancing, PRAM, Wait-free, Work complexity |
24 | Hagit Attiya, Eyal Dagan |
Improved implementations of binary universal operations. |
J. ACM |
2001 |
DBLP DOI BibTeX RDF |
contention-sensitive algorithms, deterministic coin tossing, load-linked/store-conditional operations, universal operations, wait-free algorithms, Asynchronous shared-memory systems |
24 | Frank A. Stomp, Gadi Taubenfeld |
Constructing a Reliable Test&Set Bit. |
IEEE Trans. Parallel Distributed Syst. |
1999 |
DBLP DOI BibTeX RDF |
Test&set bits, omission faults, gracefully degradation, reliability, wait-free algorithms |
24 | Yehuda Afek, Gideon Stupp, Dan Touitou |
ong-lived Adaptive Collect with Applications. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
long-lived, adaptive, distributed algorithms, mutual-exclusion, collect, wait-free, snapshot |
24 | Jing Chen, Alan Burns 0001 |
Loop-Free Asynchronous Data Sharing in Multiprocessor Real-Time Systems Based on Timing Properties. |
RTCSA |
1999 |
DBLP DOI BibTeX RDF |
Data sharing mechanism, Asynchronous data sharing, Wait-free, Lock-free, Loop-free |
24 | Nir Shavit, Asaph Zemach |
Diffracting Trees. |
ACM Trans. Comput. Syst. |
1996 |
DBLP DOI BibTeX RDF |
index distribution, contention, wait free, lock free, counting networks |
24 | Ambuj K. Singh, James H. Anderson, Mohamed G. Gouda |
The Elusive Atomic Register. |
J. ACM |
1994 |
DBLP DOI BibTeX RDF |
linearizability, atomic register, wait-free synchronization |
24 | Maurice Herlihy, Nir Shavit, Orli Waarts |
Low Contention Linearizable Counting |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
network gates, nonblocking construction, wait free construction, asynchronous concurrent processes, real-time order, linearizable counting networks, data structures |
23 | Gaurav Bhardwaj, Ayaz Ahmed, Sathya Peri |
Concurrent Lock-Free Dynamic Graphs with wait-free snapshots using versioning. |
ICDCN |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Pooja Aggarwal, Smruti R. Sarangi |
Lock-Free and Wait-Free Slot Scheduling Algorithms. |
IEEE Trans. Parallel Distributed Syst. |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
Are Lock-Free Concurrent Algorithms Practically Wait-Free? |
J. ACM |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Pooja Aggarwal, Giridhar Yasa, Smruti R. Sarangi |
RADIR: Lock-free and wait-free bandwidth allocation models for solid state drives. |
HiPC |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
Brief announcement: are lock-free concurrent algorithms practically wait-free? |
PODC |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
Are lock-free concurrent algorithms practically wait-free? |
STOC |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Shahar Timnat, Erez Petrank |
A practical wait-free simulation for lock-free data structures. |
PPoPP |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
Are Lock-Free Concurrent Algorithms Practically Wait-Free? |
CoRR |
2013 |
DBLP BibTeX RDF |
|
23 | Pooja Aggarwal, Smruti R. Sarangi |
Lock-Free and Wait-Free Slot Scheduling Algorithms. |
IPDPS |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Brijesh Dongol |
Formalising Progress Properties of Non-blocking Programs. |
ICFEM |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Prasad Jayanti, Srdjan Petrovic |
Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes. |
IWDC |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Maged M. Michael |
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. |
IEEE Trans. Parallel Distributed Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Sergio Rajsbaum, Michel Raynal, Corentin Travers |
The Iterated Restricted Immediate Snapshot Model. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Rachid Guerraoui, Michel Raynal |
From Unreliable Objects to Reliable Objects: The Case of Atomic Registers and Consensus. |
PaCT |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Achour Mostéfaoui, Michel Raynal, Corentin Travers |
From Renaming to Set Agreement. |
SIROCCO |
2007 |
DBLP DOI BibTeX RDF |
|
20 | Burkhard Englert |
On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention. |
OPODIS |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers |
The Committee Decision Problem. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Eli Gafni, Sergio Rajsbaum |
Musical Benches. |
DISC |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Alex Brodsky, Faith Ellen Fich |
Efficient synchronous snapshots. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
multiprocessor algorithms, shared memory objects |
20 | Lisa Higham, Jalal Kawash |
Implementing Sequentially Consistent Programs on Processor Consistent Platforms. |
ISPAN |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Michael Merritt, Gadi Taubenfeld |
Resilient Consensus for Infinitely Many Processes. |
DISC |
2003 |
DBLP DOI BibTeX RDF |
|
20 | Kleoni Ioannidou |
Transformations of Self-Stabilizing Algorithms. |
DISC |
2002 |
DBLP DOI BibTeX RDF |
|
20 | David Hovemeyer, William W. Pugh, Jaime Spacco |
Atomic Instructions in Java. |
ECOOP |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Eli Gafni, Michael Merritt, Gadi Taubenfeld |
The concurrency hierarchy, and algorithms for unbounded concurrency. |
PODC |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Jerry James, Ambuj K. Singh |
Fault Tolerance Bounds for Memory Consistency. |
WDAG |
1997 |
DBLP DOI BibTeX RDF |
|
20 | 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 |
20 | Jaap-Henk Hoepman, John Tromp |
Binary Snapshots. |
WDAG |
1993 |
DBLP DOI BibTeX RDF |
waitfree implementations, shared memory, atomicity, snapshot, linearisability |
20 | Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi |
A Proof Technique for Register Automicity. |
FSTTCS |
1988 |
DBLP DOI BibTeX RDF |
|
19 | Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch |
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Radha Rani, Dharmendra Prasad Mahato |
A randomized algorithm for the wait-free consensus problem. |
J. Supercomput. |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Dan Alistarh, Faith Ellen, Joel Rybicki |
Wait-free approximate agreement on graphs. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Armando Castañeda, Gilde Valeria Rodríguez |
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Ilya Kokorin, Dan Alistarh, Vitaly Aksenov |
Wait-free Trees with Asymptotically-Efficient Range Queries. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Gaurav Bhardwaj, Abhay Jain, Bapi Chatterjee, Sathya Peri |
Wait-Free Updates and Range Search using Uruv. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Gaurav Bhardwaj, Sathya Peri, Pratik Shetty |
Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Hossein Naderibeni, Eric Ruppert |
A Wait-free Queue with Polylogarithmic Step Complexity. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Radha Rani, Dharmendra Prasad Mahato |
Survey on wait-free consensus protocol in distributed systems. |
Int. J. Commun. Networks Distributed Syst. |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Gaurav Bhardwaj, Sathya Peri, Pratik Shetty |
Brief Announcement: Non-blocking Dynamic Unbounded Graphs with Wait-Free Snapshot. |
SSS |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Gaurav Bhardwaj, Bapi Chatterjee, Abhay Jain, Sathya Peri |
Wait-Free Updates and Range Search Using Uruv. |
SSS |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Matthew J. Parkinson, Sylvan Clebsch, Ben Simner |
Wait-Free Weak Reference Counting. |
ISMM |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Hossein Naderibeni, Eric Ruppert |
A Wait-free Queue with Polylogarithmic Step Complexity. |
PODC |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Armando Castañeda, Gilde Valeria Rodríguez |
Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability. |
PODC |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Shalom M. Asbell, Eric Ruppert |
A Wait-Free Deque With Polylogarithmic Step Complexity. |
OPODIS |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Marco Bornstein, Tahseen Rabbani, Evan Wang, Amrit S. Bedi, Furong Huang |
SWIFT: Rapid Decentralized Federated Learning via Wait-Free Model Communication. |
ICLR |
2023 |
DBLP BibTeX RDF |
|
19 | Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin, Ludmila Courtillat-Piazza |
Extending the wait-free hierarchy to multi-threaded systems. |
Distributed Comput. |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Xiangzhen Ouyang, Yian Zhu |
wfspan: Wait-free Dynamic Memory Management. |
ACM Trans. Embed. Comput. Syst. |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars |
An Efficient Wait-free Resizable Hash Table. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Takamitsu Shioi, Takashi Kambayashi, Suguru Arakawa, Ryoji Kurosawa, Satoshi Hikida, Haruo Yokota |
Serializable HTAP with Abort-/Wait-free Snapshot Read. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
19 | Marco Bornstein, Tahseen Rabbani, Evan Wang, Amrit Singh Bedi, Furong Huang |
SWIFT: Rapid Decentralized Federated Learning via Wait-Free Model Communication. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Ruslan Nikolaev 0001, Binoy Ravindran |
wCQ: A Fast Wait-Free Queue with Bounded Memory Usage. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
19 | Dolev Adas, Roy Friedman |
A Fast Wait-Free Multi-Producers Single-Consumer Queue. |
ICDCN |
2022 |
DBLP DOI BibTeX RDF |
|
19 | Naama Ben-David, Guy E. Blelloch |
Fast and Fair Randomized Wait-Free Locks. |
PODC |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 460 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ >>] |
|