New Optimized Priority CPU Scheduling Algorithm by Using Knapsack (NOPSACK)Journal
: GRD Journal for Engineering (Vol.5, No. 6)
Publication Date: 2020-06-01
Authors : Abdulrafa Hoseen Maree; Najim Abdullah Tahhan; Mahor Talal Mohamed;
Page : 24-31
Keywords : CPU Scheduling; Priority CPU Scheduling; Turnaround Time; Waiting Time; Context Switching; Gantt Chart; Knapsack Algorithm; Starvation;
Source : Download Find it from : Google Scholar
The concept of processes scheduling has had a major role since the advent of operating scheduling policies, the CPU plays a significant role in the computer system by transferring control between different processes and must work efficiently, the operating system performs a basic task, which is scheduling the processor for its efficient and optimized use. Scheduling the processor is one of the most important operational implemented through the operating system. Different algorithms for processor scheduling exist including the scheduling algorithm of priority. The priority number makes the algorithm effective. In this research, a proposed algorithm for scheduling the processor between processes was adopted using the KNAPSACK algorithm in order to eliminate the waiting state and starvation situation that occurs for low priority processes.
Citation: Abdulrafa Hoseen Maree , Najim Abdullah tahhan , Mahor Talal Mohamed, Mahor Talal Mohamed. "New Optimized Priority CPU Scheduling Algorithm by Using Knapsack (NOPSACK)." Global Research and Development Journal For Engineering 5.6 (2020): 24 - 31.
Last modified: 2020-06-07 17:19:36