To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Performance Analysis of STS-NP Algorithm with variation in Context Switching Time |
|
Author |
Sheikh Muhammad Bilawal, Muhammad Adnan Khan |
| Citation |
Vol. 26 No. 9 pp. 61-68 |
|
Abstract |
Short Term Scheduling (STS) algorithms are available which is very helpful for operating system to select the processes for execution. Each process has its own arrival time and execution time (burst time). A burst time is a time period, which indicates the total time taken by a process for its execution. A STS algorithm tries to maximize the CPU utilizations. One factor that effect CPU utilization is context switching time. This paper presents that, with Non-Preemptive (STS) scheduling algorithms if context switching time varies then it produced impact upon the performance of CPU. Furthermore, this is finished by utilizing deterministic model and queuing model. |
|
Keywords |
STS, NP, PCB, Burst time, Deterministic model, Execution Time, context switching, Arrival time |
|
URL |
