Analytical Performance Comparison of BNP Scheduling Algorithms

Provided by: Global Journals
Topic: Hardware
Format: PDF
Parallel computing is related to the application of many computers running in parallel to solve computationally intensive problems. One of the biggest issues in parallel computing is efficient task scheduling. In this paper, the authors survey the algorithms that allocate a parallel program represented by an edge-Directed Acyclic Graph (DAG) to a set of homogenous processors with the objective of minimizing the completion time. They examine several such classes of algorithms and then compare the performance of a class of scheduling algorithms known as the Bounded Number of Processors (BNP) scheduling algorithms.

Find By Topic