Sciweavers

43 search results - page 2 / 9
» Simulating the performance of a Class-Based Weighted Fair Qu...
Sort
View
PODC
2006
ACM
13 years 11 months 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
INFOCOM
2002
IEEE
13 years 10 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
FPL
2006
Springer
124views Hardware» more  FPL 2006»
13 years 9 months ago
A Dynamically Reconfigurable Queue Scheduler
In this paper we present the design and implementation of a dynamically reconfigurable system for packet queue scheduling. Two widely accepted queue schedulers have been implement...
Christoforos Kachris, Stamatis Vassiliadis
ICNP
2000
IEEE
13 years 9 months ago
Differentiated Predictive Fair Service for TCP Flows
The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spu...
Ibrahim Matta, Liang Guo
RTSS
1999
IEEE
13 years 9 months ago
Parallel Switching in Connection-Oriented Networks
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarant...
James H. Anderson, Sanjoy K. Baruah, Kevin Jeffay