319 search results - page 29 / 64 » Worst-Case Analysis of Scheduling Heuristics of Parallel Sys... |
RTCSA
2000
IEEE
14 years 6 hour ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...
IWNAS
2008
IEEE
14 years 2 months ago
2008
IEEE
We study parallel job scheduling, where each job may be scheduled on any number of available processors in a given parallel system. We propose a mathematical model to estimate a j...
CCGRID
2002
IEEE
14 years 18 days ago
2002
IEEE
This paper presents a performance analysis of marketbased batch schedulers for clusters of workstations. In contrast to previous work, we use user-centric performance metrics as t...
EUROPAR
2000
Springer
13 years 11 months ago
2000
Springer
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...
ICPPW
2009
IEEE
14 years 2 months ago
2009
IEEE
—The increasing attention on global scheduling algorithms for identical multiprocessor platforms produced different, independently developed, schedulability tests. However, the e...