Sciweavers

2057 search results - page 139 / 412
» Scalable and Structured Scheduling
Sort
View
CP
2004
Springer
14 years 1 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
SIGMETRICS
2010
ACM
195views Hardware» more  SIGMETRICS 2010»
13 years 12 months ago
CWS: a model-driven scheduling policy for correlated workloads
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
ISCA
2000
IEEE
121views Hardware» more  ISCA 2000»
14 years 8 days ago
Memory access scheduling
The bandwidth and latency of a memory system are strongly dependent on the manner in which accesses interact with the “3-D” structure of banks, rows, and columns characteristi...
Scott Rixner, William J. Dally, Ujval J. Kapasi, P...
IJCAI
2003
13 years 9 months ago
Distributed Patient Scheduling in Hospitals
Patient scheduling in hospitals is a highly complex task. Hospitals have a distributed organisational structure; being divided into several autonomous wards and ancillary units. M...
Torsten O. Paulussen, Nicholas R. Jennings, Keith ...
ECAI
1998
Springer
14 years 4 days ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein