A List Scheduling Algorithm for Scheduling Multi-user Jobs on Clusters

Authors:
Jorge Barbosa;António P. Monteiro
Affiliations:
Faculdade de Engenharia, Departamento de Engenharia Informática, Universidade do Porto,;Faculdade de Engenharia, Departamento de Engenharia Informática, Universidade do Porto, and INEB - Instituto de Engenharia Biomédica, Lab. Sinal e Imagem, Porto, Portugal 4200-465
Venue:
High Performance Computing for Computational Science - VECPAR 2008
Year:
2008

Citing 16
Cited 0

Analysis and evaluation of heuristic methods for static task scheduling

Journal of Parallel and Distributed Computing
Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs

IEEE Transactions on Parallel and Distributed Systems
Scheduling parallel tasks with individual deadlines

Theoretical Computer Science
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Application-level scheduling on distributed heterogeneous networks

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
On the Granularity and Clustering of Directed Acyclic Task Graphs

IEEE Transactions on Parallel and Distributed Systems
Scheduling Parallel Applications Using Malleable Tasks on Clusters

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Algorithm-Dependant Method to Determine the Optimal Number of Computers in Parallel Virtual Machines

VECPAR '98 Selected Papers and Invited Talks from the Third International Conference on Vector and Parallel Processing
Linear Algebra Algorithms in Heterogeneous Cluster of Personal Computers

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
LAPACK Working Note 96: Scalable Universal Matrix Multiplication Algorithm

LAPACK Working Note 96: Scalable Universal Matrix Multiplication Algorithm
Performance evaluation of a list scheduling algorithm in distributed memory multiprocessor systems

Future Generation Computer Systems - Special issue: Modeling and simulation in supercomputing and telecommunications
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

Algorithmica
Mapping of Subtasks with Multiple Versions in a Heterogeneous Ad Hoc Grid Environment

ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
On multiprocessor task scheduling using efficient state space search approaches

Journal of Parallel and Distributed Computing
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of scheduling multi-user jobs on clusters, both homogeneous and heterogeneous. A user job is composed by a set of dependent tasks and it is described by a direct acyclic graph (DAG). The aim is to maximize the resource usage by allowing a floating mapping of processors to a given job, instead of the common mapping approach that assigns a fixed set of processors to a user for a period of time. The simulation results show a better cluster usage. The scheduling algorithm minimizes the total length of the schedule (makespan ) of a given set of parallel jobs, whose priorities are represented in a DAG. The algorithm is presented as producing static schedules although it can be adapted to a dynamic behavior as discussed in the paper.