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