Performance Comparison Of Bnp Scheduling Algorithms In Homogeneous Environment

§ Maharishi Markandeshwar University

Send Message

To: Author

Performance Comparison Of Bnp Scheduling Algorithms In Homogeneous Environment

Article Fingerprint

ReserarchID

CSTQ72M3

Performance Comparison Of Bnp Scheduling Algorithms In Homogeneous Environment Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background

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.

References

10 Cites in Article
  1. Parneet Kaur,Dheerendra Singh,Gurvinder Singh,Navneet Singh (2011). Analysis, Comparison and Performance Evaluation of BNP Scheduling Algorithms in Parallel Processing.
  2. Ishfaq Ahmad,Yu-Kwong Kwok Performance Comparison of Algorithm for Static Scheduling of DAG to multiprocessor.
  3. Ishfaq Ahmad,Yu-Kwong Kwok (1998). Benchmarking and comparison of the Task Graph Scheduling algorithms.
  4. Ishfaq Ahmad,Yu-Kwong Kwok,Min-You Wu (1996). Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors.
  5. T Hagras,J Janeček (2003). Static vs. Dynamic List-Scheduling Performance Comparison.
  6. G Dror,Larry Feitelson,Rudolph Parallel Job Scheduling: Issues and Approaches.
  7. Min You Wu (1997). On parallelization of Static Scheduling Algorithm.
  8. Shiyuan Jin,Guy Schiavone,Damla Turgut (2008). A performance study of multiprocessor task scheduling algorithms.
  9. L Thomas,Casavant (1988). A taxonomy of Scheduling in General-Purpose Distributed Computing Systems.
  10. Thomas Adam,K Chandy,J Dickson (1974). A comparison of list schedules for parallel processing systems.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

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).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST Classification D.4.8
Version of record

v1.2

Issue date
April 21, 2012

Language
English
Experiance in AR

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.

Read in 3D

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.

Article Matrices
Total Views: 8.6K
Total Downloads: 593
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Performance Comparison Of Bnp Scheduling Algorithms In Homogeneous Environment

Dr. Arora
Dr. Arora Maharishi Markandeshwar University