Sciweavers

58 search results - page 4 / 12
» Scheduling policies for CIOQ switches
Sort
View
SIGMETRICS
2004
ACM
127views Hardware» more  SIGMETRICS 2004»
14 years 26 days ago
Performance analysis of LAS-based scheduling disciplines in a packet switched network
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...
Idris A. Rai, Guillaume Urvoy-Keller, Mary K. Vern...
ICC
2007
IEEE
14 years 1 months ago
A Measurement Based Dynamic Policy for Switched Processing Systems
Abstract- Switched Processing Systems (SPS) represent a canonical model for many areas of applications of communication, computer and manufacturing systems. They are characterized ...
Ying-Chao Hung, George Michailidis
SPAA
2004
ACM
14 years 26 days ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
ENTCS
2002
88views more  ENTCS 2002»
13 years 7 months ago
Testing Concurrent Java Programs using Randomized Scheduling
The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness...
Scott D. Stoller