A scheduling algorithm for parallelizable dependent tasks

Authors:
Belkhale; Banerjee
Affiliations:
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA;Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
Venue:
IPPS '91 Proceedings of the Fifth International Parallel Processing Symposium
Year:
1991

Citing 0
Cited 2

Approximation Algorithms for Scheduling Parallel Jobs

SIAM Journal on Computing
Versatile time-cost algorithm VTCA for scheduling non-preemptive tasks of time critical workflows in cloud computing systems

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling a collection of tasks on a multiprocessor consisting of p processors, that minimizes the maximum completion time has attracted a lot of attention in the literature. The paper introduces a new problem of scheduling a task graph on a multiprocessor, called the parallelizable dependent task scheduling problem. Associated with each task is the time it takes to run on a uniprocessor, and the speedup that can be obtained by running it on i processors, 1脙or=i脙or=p. The paper presents an algorithm for the problem and analyzes the performance.