Paper Info
Title
Effects of Hard Real-Time Constraints in Implementing the Myopic Scheduling Algorithm.
Abstract
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 sizeof the Window since it considers only k processes from n processes (where, k<= n). 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.
Year
Venue
Field
2014
CoRR
Heuristic function,Mathematical optimization,Computer science,Scheduling (computing),Queue,Real-time computing,Scheduling heuristics,Earliest deadline first scheduling,Dynamic priority scheduling,Distributed computing
DocType
Volume
Citations 
Journal
abs/1407.0122
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
Kazi Sakib13214.67
M. S. Hasan200.34
M. Alamgir Hossain310716.52