Sciweavers

1758 search results - page 58 / 352
» Schedule processes, not VCPUs
Sort
View
PDPTA
2007
15 years 8 months ago
Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
Xinxin Liu, Han Zhao, Xiaolin Li
MASCOTS
2004
15 years 8 months ago
Simulation Evaluation of Hybrid SRPT Scheduling Policies
This paper uses trace-driven simulations to evaluate two novel Web server scheduling policies called KSRPT and T-SRPT. K-SRPT is a multi-threaded version of SRPT (Shortest Remaini...
Mingwei Gong, Carey L. Williamson
ENTCS
2008
156views more  ENTCS 2008»
15 years 6 months ago
Schedulability Criteria and Analysis for Dynamic and Flexible Resource Management
The Flexible Resource Manager (FRM) is a dynamic resource management approach that allows a better utilization of the available resources. However, it necessitates an atomic recon...
Hermann Simon Lichte, Simon Oberthür
EOR
2007
103views more  EOR 2007»
15 years 6 months ago
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Consider a single machine and a set of   jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
JCO
2007
100views more  JCO 2007»
15 years 6 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye