One can only gain by replacing EASY Backfilling: A simple scheduling policies case study
D Carastan-Santos, RY De Camargo… - 2019 19th IEEE/ACM …, 2019 - ieeexplore.ieee.org
High-Performance Computing (HPC) platforms are growing in size and complexity. In order
to improve the quality of service of such platforms, researchers are devoting a great amount …
to improve the quality of service of such platforms, researchers are devoting a great amount …
Job allocation strategies with user run time estimates for online scheduling in hierarchical grids
We address non-preemptive non-clairvoyant online scheduling of parallel jobs on a Grid.
We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to …
We consider a Grid scheduling model with two stages. At the first stage, jobs are allocated to …
Approximation algorithms for multiple strip packing
In this paper we study the Multiple Strip Packing (MSP) problem, a generalization of the well-
known Strip Packing problem. For a given set of rectangles, r 1,..., rn, with heights and …
known Strip Packing problem. For a given set of rectangles, r 1,..., rn, with heights and …
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
We consider two strongly related problems, multiple strip packing and scheduling parallel
jobs in platforms. In the first one we are given a list of n rectangles with heights and widths …
jobs in platforms. In the first one we are given a list of n rectangles with heights and widths …
Fast heuristic algorithms for the multiple strip packing problem
I Vasilyev, AV Ushakov, MV Barkova, D Zhang… - … Optimization Theory and …, 2021 - Springer
In this paper we address the so-called two-dimensional Multiple Strip Packing Problem
(MSPP). There is a set of rectangles and a set of strips, where each strip has a pre-defined …
(MSPP). There is a set of rectangles and a set of strips, where each strip has a pre-defined …
Generalized multiple strip packing problem: Formulations, applications, and solution algorithms
I Vasilyev, AV Ushakov, D Zhang, J Ren - Computers & Industrial …, 2023 - Elsevier
In this paper we address a novel extension of the well-known multiple strip packing problem.
Given a set of rectangular items that must be packed into a set of strips of predefined widths …
Given a set of rectangular items that must be packed into a set of strips of predefined widths …
A fast 5/2-approximation algorithm for hierarchical scheduling
We present in this article a new approximation algorithm for scheduling a set of n
independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical …
independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical …
Linear time algorithms for multiple cluster scheduling and multiple strip packing
Abstract We study the Multiple Cluster Scheduling problem and the Multiple Strip Packing
problem. For both problems, there is no algorithm with approximation ratio better than 2 …
problem. For both problems, there is no algorithm with approximation ratio better than 2 …
[HTML][HTML] Improved approximation algorithms for scheduling parallel jobs on identical clusters
Abstract The Multiple Cluster Scheduling Problem corresponds to minimizing the maximum
completion time (makespan) of a set of n parallel rigid (and non-preemptive) jobs submitted …
completion time (makespan) of a set of n parallel rigid (and non-preemptive) jobs submitted …