Sciweavers

5580 search results - page 11 / 1116
» Randomized priority algorithms
Sort
View
VLDB
1989
ACM
72views Database» more  VLDB 1989»
13 years 11 months ago
Priority in DBMS Resource Scheduling
- In this paper, we addressthe problem of priority scheduling in a databasemanagement system. We start by investigating the architectural consequences of adding priority to a DBMS....
Michael J. Carey, Rajiv Jauhari, Miron Livny
SCHEDULING
2010
116views more  SCHEDULING 2010»
13 years 6 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
INFOCOM
2007
IEEE
14 years 2 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin