614 search results - page 9 / 123 » Resource Minimization Job Scheduling |
121
click to vote
EOR
2010
14 years 9 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
108
click to vote
LCN
2006
IEEE
15 years 5 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
123
click to vote
COR
2011
14 years 6 months ago
2011
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
TOCS
2008
14 years 11 months ago
2008
We present an adaptive work-stealing thread scheduler, ASTEAL, for fork-join multithreaded jobs, like those written using the Cilk multithreaded language or the Hood work-stealing...
112
click to vote
ICS
2005
Tsinghua U.
15 years 5 months ago
2005
Tsinghua U.
Traditionally, scheduling in high-end parallel systems focuses on how to minimize the average job waiting time and on how to maximize the overall system utilization. Despite the d...