Sciweavers

191 search results - page 14 / 39
» Multipartite priority queues
Sort
View
ICDE
2000
IEEE
110views Database» more  ICDE 2000»
14 years 8 months ago
A Novel Deadline Driven Disk Scheduling Algorithm for Multi-Priority Multimedia Objects
In this paper we introduce a new deadline driven disk scheduling algorithm designed for multimedia servers. The proposed algorithm supports real time requests with multiple priori...
Ibrahim Kamel, T. Niranjan, Shahram Ghandeharizade...
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
14 years 2 months ago
Priority based forced requeue to reduce worst-case latencies for bursty traffic
- In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low pri...
Mikael Millberg, Axel Jantsch
ETT
2002
89views Education» more  ETT 2002»
13 years 7 months ago
Delay analysis of a probabilistic priority discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko
INFOCOM
2002
IEEE
14 years 10 days ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea
JFP
2006
67views more  JFP 2006»
13 years 7 months ago
Finger trees: a simple general-purpose data structure
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...
Ralf Hinze, Ross Paterson