Performance Comparison Of Bnp Scheduling Algorithms In Homogeneous Environment

Abstract

Static Scheduling is the mapping of a program to the resources of a parallel system in order to minimize the execution time. This paper presents static scheduling algorithms that schedule an edge-weighted directed acyclic graph (DAG) to a set of homogeneous processors. The aim is to evaluate and compare the performance of different algorithms and select the best algorithm amongst them. Various BNP algorithms are analyzed and classified into four groups -Highest Level First Estimated Time (HLFET), Dynamic Level Scheduling (DLS), Modified Critical Path (MCP) and Earliest Time First (ETF). Based upon their performance considering various factors, best algorithm is determined.

A Study of Conflict Issues Affecting Ugandan Housemaids who Migrate to Saudi Arabia and How to Mitigate them

March 10, 2026

This study aims to comprehensively analyse the complex interplay between

AI TAKEAWAY

Abstract

References

Funding

Conflict of Interest

Ethical Approval

Data Availability

How to Cite This Article

Download Citation

GJCST Volume 12 Issue 8

Journal Specifications

Keywords

Version of record

Issue date

Language

Experiance in AR

Read in 3D

Article Matrices

Global Journals Publishing Group, Incorporated

Publishing

Researchers

Policies

Governance

Request Access

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading