173 search results - page 24 / 35 » Special Cases of Online Parallel Job Scheduling |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
JCO
2010
13 years 6 months ago
2010
This paper considers an on-line scheduling problem occurred in a service system with two classes (normal and special) of customers and two types (dedicated and flexible) of serve...
CISIS
2011
IEEE
12 years 7 months ago
2011
IEEE
—Computational performance increasingly depends on parallelism, and many systems rely on heterogeneous resources such as GPUs and FPGAs to accelerate computationally intensive ap...
PPAM
2001
Springer
14 years 9 days ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
CCGRID
2001
IEEE
13 years 11 months ago
2001
IEEE
The Compute Power Market (CPM) is a market-based resource management and job scheduling system for grid computing on Internet-wide computational resources, particularly low-end pe...