1536 search results - page 46 / 308 » DPS - Dynamic Parallel Schedules |
CEC
2003
IEEE
15 years 4 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
113
click to vote
IPCO
1998
15 years 17 days ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
HPCC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We present a parallel job scheduling approach for coarsegrain timesharing which preempts jobs to disk and avoids any additional memory pressure. The approach provides con...
ICPADS
2006
IEEE
15 years 5 months ago
2006
IEEE
While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely at...
IPPS
1999
IEEE
15 years 3 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...