319 search results - page 9 / 64 » Worst-Case Analysis of Scheduling Heuristics of Parallel Sys... |
HPDC
2007
IEEE
14 years 1 months ago
2007
IEEE
Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic repre...
ENC
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we consider parallel tasks scheduling problems for hierarchical decentralized systems that consist of homogeneous computational resources such as clusters, PCs and ...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
COR
2007
13 years 7 months ago
2007
Many approaches have been taken in academic environments to address the problem of student and course timetabling. Typically, student scheduling and course scheduling have been tr...
JSSPP
2005
Springer
14 years 1 months ago
2005
Springer
Irregular and iterative I/O-intensive jobs need a different approach from parallel job schedulers. The focus in this case is not only the processing requirements anymore: memory, ...