Staffordshire University logo
STORE - Staffordshire Online Repository

Effects of Hard Real-Time Constraints in Implementing the Myopic Scheduling Algorithm

Sakib, K. M., HASAN, Mohammad and Hossain, M. A. (2007) Effects of Hard Real-Time Constraints in Implementing the Myopic Scheduling Algorithm. The Journal of Computer Science. ISSN 1549-3636

Effects_of_Hard_Real-Time_Constraints_in_Implement.pdf - AUTHOR'S ACCEPTED Version (default)

Download (202kB) | Preview

Abstract or description

Myopic is a hard real-time process scheduling algorithm that selects a suitable process based on a heuristic function from a subset (Window) of all ready processes instead of choosing from all available processes, like original heuristic scheduling algorithm. Performance of the algorithm significantly depends on the chosen heuristic function that assigns weight to different parameters like deadline, earliest starting time, processing time etc. and the size of the Window since it considers only processes from processes (where, knnk≤). This research evaluates the performance of the Myopic algorithm for different parameters to demonstrate the merits and constraints of the algorithm. A comparative performance of the impact of window size in implementing the Myopic algorithm is presented and discussed through a set of experiments.

Item Type: Article
Faculty: School of Computing and Digital Technologies > Computing
Depositing User: Mohammad HASAN
Date Deposited: 24 Jan 2018 14:05
Last Modified: 24 Feb 2023 13:49

Actions (login required)

View Item View Item

DisabledGo Staffordshire University is a recognised   Investor in People. Sustain Staffs
Legal | Freedom of Information | Site Map | Job Vacancies
Staffordshire University, College Road, Stoke-on-Trent, Staffordshire ST4 2DE t: +44 (0)1782 294000