The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase wait-free algorithms (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1990-2005 (15) 2006-2010 (4)
Publication types (Num. hits)
article(8) inproceedings(11)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 55 occurrences of 43 keywords

Results
Found 19 publication records. Showing 19 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
2Hagit Attiya, Arie Fouren Algorithms adapting to point contention. Search on Bibsonomy J. ACM The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Contention-sensitive complexity, read/write registers, collect, renaming, wait-free algorithms, asynchronous shared-memory systems
2James H. Anderson, Philip Holman Efficient pure-buffer algorithms for real-time systems. Search on Bibsonomy RTCSA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF efficient pure-buffer algorithms, multiprocessor real-time systems, multi-writer read/write pure-buffers, overwritten data, client processes, handshaking mechanisms, concurrent read/write operations safety, quantum-scheduled systems, priority-scheduled systems, buffer word length, real-time systems, computational complexity, distributed algorithms, safety, multiprocessing systems, time complexity, processor scheduling, optimized algorithms, buffer storage, space complexity, wait-free algorithms, shared buffers, processor number
2Hagit Attiya, Nancy A. Lynch, Nir Shavit Are Wait-Free Algorithms Fast? Search on Bibsonomy J. ACM The full citation details ... 1994 DBLP  DOI  BibTeX  RDF approximate agreement, fault-tolerance, wait-free
2Hagit Attiya, Nancy A. Lynch, Nir Shavit Are Wait-Free Algorithms Fast? (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF shared memory distributed systems, normal executions, approximate agreement, time complexity, computation models, wait-free algorithms, execution speed
1Keren Censor-Hillel Multi-sided shared coins and randomized set-agreement. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF multi-valued shared coins, distributed computing, randomized algorithms, shared memory, set-agreement
1Dan Dobre, Matthias Majuntke, Neeraj Suri On the Time-Complexity of Robust and Amnesic Storage. Search on Bibsonomy OPODIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF distributed storage, Byzantine failures, wait-free algorithms
1Vijay A. Saraswat, Vivek Sarkar, Christoph von Praun X10: concurrent programming for modern architectures. Search on Bibsonomy PPOPP The full citation details ... 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
1Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen On utility accrual processor scheduling with wait-free synchronization for embedded real-time software. Search on Bibsonomy SAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF time/utility functions, wait-free synchronization
1Håkan Sundell Wait-Free Reference Counting and Memory Management. Search on Bibsonomy IPDPS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hai Huang 0002, Padmanabhan Pillai, Kang G. Shin Improving Wait-Free Algorithms for Interprocess Communication in Embedded Real-Time Systems. Search on Bibsonomy USENIX Annual Technical Conference, General Track The full citation details ... 2002 DBLP  BibTeX  RDF
1Hagit Attiya, Arie Fouren, Eli Gafni An adaptive collect algorithm with applications. Search on Bibsonomy Distributed Computing The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Contention-sensitive complexity, Read/write registers, Atomic snapshots, Immediate snapshots, Renaming, Wait-free algorithms, Asynchronous shared-memory systems
1Prasad Jayanti f-arrays: implementation and applications. Search on Bibsonomy PODC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Burkhard Englert, Eli Gafni Fast Collect in the absence of contention. (PDF / PS) Search on Bibsonomy ICDCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Hagit Attiya, Eyal Dagan Improved implementations of binary universal operations. Search on Bibsonomy J. ACM The full citation details ... 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
1Frank A. Stomp, Gadi Taubenfeld Constructing a Reliable Test&Set Bit. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Test&set bits, omission faults, gracefully degradation, reliability, wait-free algorithms
1Hagit Attiya, Arie Fouren Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract). Search on Bibsonomy PODC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1James H. Anderson, Srikanth Ramamurthy, Kevin Jeffay Real-Time Computing with Lock-Free Shared Objects. Search on Bibsonomy ACM Trans. Comput. Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF scheduling, synchronization, earliest deadline first, hard real time, wait free, lock free, critical sections, rate monotonic, deadline monotonic
1James H. Anderson, Mark Moir Using Local-Spin k-Exclusion Algorithms to Improve Wait-Free Object Implementations. Search on Bibsonomy Distributed Computing The full citation details ... 1997 DBLP  DOI  BibTeX  RDF k -Assignment, k -Exclusion, Shared subjects, Shared-memory multiprocessors, Resiliency, Wait-free, Local spinning
1Mark Moir, James H. Anderson Wait-Free Algorithms for Fast, Long-Lived Renaming. Search on Bibsonomy Sci. Comput. Program. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #19 of 19 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.