Abstract. 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 metrics (over-deadline, makespan and idletime) are combined with weights to evaluate the scheduling performance. Two levels of performance optimisation are applied in the multicluster. At the multicluster level, a scheduler (which we call MUSCLE) allocates parallel jobs with high packing potential to the same cluster; MUSCLE also takes the jobs ' QoS requirements into account and employs a heuristic to achieve performance balance across the multilcuster. At the single cluster level, an existing workload manager, called TITAN, utilizes a genetic algo...
Grid computing is a high performance computing environment to fulfill large-scale computational dema...
High performance distributed applications require high performance and Quality Of Service (QOS). Bec...
International audienceWe describe in this paper a new method for building an efficient algorithm for...
The paper addresses the dynamic scheduling of parallel jobs with quality-of-service demands (soft-de...
This paper addresses the dynamic scheduling of parallel jobs with QoS demands (soft-deadlines) in mu...
This paper addresses workload allocation techniques for two types of sequential jobs that might be f...
Abstract—Today’s schedulers for a parallel processing environ-ment are generally optimized for submi...
This paper proposes a two-level scheduler for dynamically scheduling a continuous stream of sequenti...
International audienceThis paper focuses on the resilient scheduling of moldable parallel jobs on hi...
This dissertation presents a taxonomy and evaluation of three cluster scheduling architectures for s...
Scheduling and resource allocation to optimize performance criteria in multi-cluster heterogeneous e...
Some meta-schedulers query the information system of individual supercomputers in order to submit jo...
In a multicluster architecture, where jobs can be submitted through each constituent cluster, the jo...
International audienceMoldable tasks allow schedulers to determine the number of processors assigned...
Abstract: This paper proposes a new scheduler to schedule parallel jobs on Clusters that may be part...
Grid computing is a high performance computing environment to fulfill large-scale computational dema...
High performance distributed applications require high performance and Quality Of Service (QOS). Bec...
International audienceWe describe in this paper a new method for building an efficient algorithm for...
The paper addresses the dynamic scheduling of parallel jobs with quality-of-service demands (soft-de...
This paper addresses the dynamic scheduling of parallel jobs with QoS demands (soft-deadlines) in mu...
This paper addresses workload allocation techniques for two types of sequential jobs that might be f...
Abstract—Today’s schedulers for a parallel processing environ-ment are generally optimized for submi...
This paper proposes a two-level scheduler for dynamically scheduling a continuous stream of sequenti...
International audienceThis paper focuses on the resilient scheduling of moldable parallel jobs on hi...
This dissertation presents a taxonomy and evaluation of three cluster scheduling architectures for s...
Scheduling and resource allocation to optimize performance criteria in multi-cluster heterogeneous e...
Some meta-schedulers query the information system of individual supercomputers in order to submit jo...
In a multicluster architecture, where jobs can be submitted through each constituent cluster, the jo...
International audienceMoldable tasks allow schedulers to determine the number of processors assigned...
Abstract: This paper proposes a new scheduler to schedule parallel jobs on Clusters that may be part...
Grid computing is a high performance computing environment to fulfill large-scale computational dema...
High performance distributed applications require high performance and Quality Of Service (QOS). Bec...
International audienceWe describe in this paper a new method for building an efficient algorithm for...