硬实时的约束对近视调度算法实现的影响
Effects of Hard Real-Time Constraints in Implementing the Myopic Scheduling Algorithm
摘要：
Myopic是一种硬实时的【形】进程调度算法，它基于启发式函数从所有就绪进程的子集（Window）中选择合适的进程，而不是像原始启发式调度算法那样从所有可用进程中选择。该算法的性能主要取决于所选择的启发式函数，该函数为不同的参数分配权重，如截止日期，最早开始时间，处理时间等，以及窗口的大小，因为它只考虑n个进程中的k个进程（其中，k<= n）。本研究评估的近视算法的性能为不同的参数，以证明该算法的优点和限制。在实施近视算法的窗口大小的影响的比较性能，并通过一组实验进行了讨论。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
