Scheduling Parallel Tasks with Communication Overhead in an Environment with Multiple Machines

Authors:
Jiann-Fu Lin
Affiliations:
-
Venue:
IEICE - Transactions on Information and Systems
Year:
2008

Citing 11
Cited 0

Scheduling Multiprocessor Tasks to Minimize Schedule Length

IEEE Transactions on Computers
Complexity of scheduling parallel task systems

SIAM Journal on Discrete Mathematics
List scheduling of parallel tasks

Information Processing Letters
A heuristic of scheduling parallel tasks and its analysis

SIAM Journal on Computing
A data intensive distributed computing architecture for “grid” applications

Future Generation Computer Systems - Special issue on high performance computing and networking Europe 1999
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Scaling Parallel Programs for Multiprocessors: Methodology and Examples

Computer
The Grid 2: Blueprint for a New Computing Infrastructure

The Grid 2: Blueprint for a New Computing Infrastructure
Sub optimal scheduling in a grid using genetic algorithms

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid

Future Generation Computer Systems - Special issue: Advanced grid technologies
Cooperation in multi-organization scheduling

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper investigates the problem of nonpreemptively scheduling independent parallel tasks in an environment with multiple machines, which is motivated from the recent studies in scheduling tasks in a multi-machine environment. In this scheduling environment, each machine contains a number of identical processors and each parallel task can simultaneously require a number of processors for its processing in any single machine. Whenever tasks are processed in parallel in a parallel machine, message communication among processors is often inevitable. The problem of finding a shortest schedule length on scheduling independent parallel tasks with the consideration of communication overhead in a multi-machine environment is NP-hard. The aim of this paper is to propose a heuristic algorithm for this kind of problem and to analyze the performance bound of this heuristic algorithm.