Sciweavers

58 search results - page 7 / 12
» Scheduling policies for CIOQ switches
Sort
View
OSDI
1996
ACM
13 years 10 months ago
CPU Inheritance Scheduling
Traditional processor scheduling mechanisms in operating systems are fairly rigid, often supportingonly one fixed scheduling policy, or, at most, a few "scheduling classes&qu...
Bryan Ford, Sai Susarla
IPPS
2002
IEEE
14 years 1 months ago
The Self-Tuning dynP Job-Scheduler
In modern resource management systems for supercomputers and HPC-clusters the job-scheduler plays a major role in improving the performance and usability of the system. The perfor...
Achim Streit
QUESTA
2010
131views more  QUESTA 2010»
13 years 7 months ago
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
Maaike Verloop, R. Núñez Queija
SIGMETRICS
2008
ACM
118views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Finding the optimal quantum size: Sensitivity analysis of the M/G/1 round-robin queue
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
Varun Gupta
ICC
2007
IEEE
14 years 2 months ago
A Cost-Effective Approach to Optical Packet/burst Scheduling
Abstract— Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due t...
Franco Callegati, Aldo Campi, Walter Cerroni