Sciweavers

50 search results - page 9 / 10
» Grouped distributed queues: distributed queue, proportional ...
Sort
View
JSSPP
2004
Springer
13 years 11 months ago
LOMARC - Lookahead Matchmaking for Multi-resource Coscheduling
Job scheduling typically focuses on the CPU with little work existing to include I/O or memory. Time-shared execution provides the chance to hide I/O and long-communication latenc...
Angela C. Sodan, Lei Lan
INFOCOM
2006
IEEE
13 years 11 months ago
TCP as an Implementation of Age-Based Scheduling: Fairness and Performance
— We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are abl...
Arzad Alam Kherani, Rudesindo Núñez-...
PPOPP
2010
ACM
14 years 13 days ago
Load balancing on speed
To fully exploit multicore processors, applications are expected to provide a large degree of thread-level parallelism. While adequate for low core counts and their typical worklo...
Steven Hofmeyr, Costin Iancu, Filip Blagojevic
ICA3PP
2011
Springer
12 years 5 months ago
Performance Analysis of Preemption-Aware Scheduling in Multi-cluster Grid Environments
Abstract. Resource provisioning is one of the main challenges in resource sharing environments such as multi-cluster Grids. In these environments each cluster serves requests from ...
Mohsen Amini Salehi, Bahman Javadi, Rajkumar Buyya
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
13 years 11 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami