64 search results - page 11 / 13 » Preemptive Scheduling of Equal-Length Jobs in Polynomial Tim... |
RTSS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
TC
2002
13 years 6 months ago
2002
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...
CCGRID
2010
IEEE
13 years 8 months ago
2010
IEEE
Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing resources in exchange for payment. In this p...
IOR
2010
13 years 5 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
WADS
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...