Sciweavers

51 search results - page 4 / 11
» Parallel Algorithms for Priority Queue Operations
Sort
View
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
13 years 11 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...
PODC
2006
ACM
14 years 9 days ago
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
We present Grouped Distributed Queues (GDQ), the first proportional share scheduler for multiprocessor systems that scales well with a large number of processors and processes. G...
Bogdan Caprita, Jason Nieh, Clifford Stein
PPOPP
2011
ACM
12 years 9 months ago
Wait-free queues with multiple enqueuers and dequeuers
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
Alex Kogan, Erez Petrank
CONCUR
2003
Springer
13 years 11 months ago
Priority Rewrite Systems for OSOS Process Languages
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
Irek Ulidowski
VL
1992
IEEE
135views Visual Languages» more  VL 1992»
13 years 10 months ago
Tidy Animations of Tree Algorithms
In software visualization and algorithm animation it is important that advances in system technologies are accompanied by corresponding advances in animation presentations. In thi...
John T. Stasko, Carlton Reid Turner