254 search results - page 26 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
JCO
2000
14 years 11 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
113
click to vote
PPAM
2007
Springer
15 years 5 months ago
2007
Springer
This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able...
105
click to vote
ISAAC
2000
Springer
15 years 2 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
IPCCC
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper addresses the problem of improving quality of security for real-time parallel applications on heterogeneous clusters. We propose a new security- and heterogeneity-drive...
IPPS
2005
IEEE
15 years 4 months ago
2005
IEEE
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...