
Article Fingerprint
ReserarchID
CSTQ72M3
Choose where you want to hide AI Takeaway. Your site-wide choice will be remembered in this browser.
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.
Dr. Nidhi Arora. 1970. "Performance Comparison Of Bnp Scheduling Algorithms In Homogeneous Environment". Global Journal of Computer Science and Technology GJCST Volume 12 (GJCST Volume 12 Issue 8).
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
v1.2
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 148
Country: India
Subject: Global Journal of Computer Science and Technology
Authors: Dr. Nidhi Arora, Navneet Singh, Parneet Kaur (PhD/Dr. count: 1)
View Count (all-time): 313
Total Views (Real + Logic): 8649
Total Downloads (simulated): 593
Publish Date: 2012 05, Tue
Monthly Totals (Real + Logic):
We use cookies and similar technologies to improve site performance, understand traffic, and enhance your publishing experience. Cookie Policy
Choose which optional cookies Global Journals can use. Your preference applies across this platform and can be updated any time.
These cookies are required for core website functionality and security.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.