Scheduling Parallel Machines On-line
SIAM Journal on Computing
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
The MOSIX multicomputer operating system for high performance cluster computing
Future Generation Computer Systems - Special issue on HPCN '97
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Smart SMART Bounds for Weighted Response Time Scheduling
SIAM Journal on Computing
Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Multiresource malleable task scheduling to minimize response time
Information Processing Letters
The AppLeS parameter sweep template: user-level middleware for the grid
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
A Model for Moldable Supercomputer Jobs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Parallel Job Scheduling: Issues and Approaches
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Job Scheduling Under the Portable Batch System
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Core Algorithms of the Maui Scheduler
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
International Journal of High Performance Computing Applications
A multicriteria approach to two-level hierarchy scheduling in grids
Journal of Scheduling
On cluster resource allocation for multiple parallel task graphs
Journal of Parallel and Distributed Computing
Fast multi-objective reschulding of grid jobs by heuristics and evolution
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Approximating minimum cut with bounded size
INOC'11 Proceedings of the 5th international conference on Network optimization
Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks
Journal of Parallel and Distributed Computing
Parallel job scheduling for power constrained HPC systems
Parallel Computing
Job scheduling using successive linear programming approximations of a sparse model
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
A multi-criteria job scheduling framework for large computing farms
Journal of Computer and System Sciences
MROrder: flexible job ordering optimization for online mapreduce workloads
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of processors. The main feature is to consider two criteria that are optimized together. These criteria are the makespan and the weighted minimal average completion time (minsum). They are chosen for their complementarity, to be able to represent both user-oriented objectives and system administrator objectives.We propose an algorithm based on a batch policy with increasing batch sizes, with a smart selection of jobs in each batch. This algorithm is assessed by intensive simulation results, compared to a new lower bound (obtained by a relaxation of ILP) of the optimal schedules for both criteria separately. It is currently implemented in an actual real-size cluster platform.