130 search results - page 12 / 26 » A Parallel Priority Queue with Constant Time Operations |
171
Voted
NIXDORF
1992
15 years 10 months ago
1992
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
144
click to vote
ICPP
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time f...
166
click to vote
ADAEUROPE
2003
Springer
15 years 11 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
149
click to vote
ICALP
1995
Springer
15 years 9 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
153
click to vote
ICST
2008
IEEE
16 years 8 days ago
2008
IEEE
Real-time embedded systems typically include concurrent tasks of different priorities with time-dependent operations accessing common resources. In this context, unsynchronized pa...