68 search results - page 4 / 14 » Improving Parallel Job Scheduling by Combining Gang Scheduli... |
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
GCC
2004
Springer
13 years 11 months ago
2004
Springer
This paper addresses the dynamic scheduling of moldable jobs with QoS demands (soft-deadlines) in multiclusters. A moldable job can be run on a variable number of resources. Three ...
CCGRID
2006
IEEE
13 years 11 months ago
2006
IEEE
Security-sensitive applications that access and generate large data sets are emerging in various areas such as bioinformatics and high energy physics. Data grids provide data-inte...
JCO
1998
13 years 5 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
ICS
1999
Tsinghua U.
13 years 10 months ago
1999
Tsinghua U.
Instruction scheduling is an important compiler technique for exploiting more instruction-level parallelism (ILP) in high-performance microprocessors, and in this paper, we study ...