Sciweavers

191 search results - page 15 / 39
» Melding Priority Queues
Sort
View
ETT
2002
89views Education» more  ETT 2002»
14 years 9 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
15 years 2 months 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»
14 years 9 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
WSC
2008
15 years 6 days ago
Priority mix planning for cycle time-differentiated semiconductor manufacturing services
Semiconductor fabs often offer manufacturing service of multiple priorities in terms of cycle time-based X-factor targets (XFTs) and fab production must be planned accordingly. Th...
Shi-Chung Chang, Shin-Shyu Su, Ke-Ju Chen
LCN
2003
IEEE
15 years 3 months ago
Analysis of Prioritized Scheduling of Assured Forwarding in DiffServ Architectures
Assured Service has been proposed within the Differentiated Services (DiffServ) model to provide relative service differentiation by attempting to allocate bandwidth to different ...
Nzinga D. Kiameso, Hossam S. Hassanein, Hussein T....