|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14 occurrences of 9 keywords
|
|
|
Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
119 | Gadi Taubenfeld |
Contention-Sensitive Data Structures and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pp. 157-171, 2009, Springer, 978-3-642-04354-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Contention-sensitive, shortcut code, disable-free, prevention-free, k-obstruction-free, synchronization, locks, wait-free, starvation, livelock |
24 | Hagit Attiya, Arie Fouren |
Algorithms adapting to point contention. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 50(4), pp. 444-468, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Contention-sensitive complexity, read/write registers, collect, renaming, wait-free algorithms, asynchronous shared-memory systems |
24 | Hagit Attiya, Arie Fouren, Eli Gafni |
An adaptive collect algorithm with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 15(2), pp. 87-96, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Contention-sensitive complexity, Read/write registers, Atomic snapshots, Immediate snapshots, Renaming, Wait-free algorithms, Asynchronous shared-memory systems |
24 | Hagit Attiya, Eyal Dagan |
Improved implementations of binary universal operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(5), pp. 1013-1037, 2001. The full citation details ...](Pics/full.jpeg) |
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 |
19 | Gadi Taubenfeld |
Contention-sensitive data structures and algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 677, pp. 41-55, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Daniel Goodman, Georgios Varisteas, Tim Harris 0001 |
Pandia: comprehensive contention-sensitive thread placement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroSys ![In: Proceedings of the Twelfth European Conference on Computer Systems, EuroSys 2017, Belgrade, Serbia, April 23-26, 2017, pp. 254-269, 2017, ACM, 978-1-4503-4938-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Catherine E. Jarrett, Bryan C. Ward, James H. Anderson |
A contention-sensitive fine-grained locking protocol for multiprocessor real-time systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTNS ![In: Proceedings of the 23rd International Conference on Real Time Networks and Systems, RTNS 2015, Lille, France, November 4-6, 2015, pp. 3-12, 2015, ACM, 978-1-4503-3591-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
19 | Eduardo Javier Huerta Yero, Marco Aurélio Amaral Henriques |
Contention-sensitive static performance prediction for parallel distributed applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Perform. Evaluation ![In: Perform. Evaluation 63(4-5), pp. 265-277, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Ramaraghavan Srinivasan, Vipin Chaudhary, Syed Masud Mahmud |
Contention sensitive fault-tolerant routing algorithms for hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN 1994, Kanazawa, Japan, December 14-16, 1994, pp. 197-204, 1994, IEEE Computer Society, 0-8186-6507-6. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
10 | Maged M. Michael |
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, PODC 2002, Monterey, California, USA, July 21-24, 2002, pp. 21-30, 2002, ACM, 1-58113-485-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|