From 826bb1652752b91cd18df1c42cc65814e30426ee Mon Sep 17 00:00:00 2001 From: Shivam2510 <43674275+Shivam2510@users.noreply.github.com> Date: Fri, 2 Oct 2020 11:28:41 +0530 Subject: [PATCH 1/2] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index e5cb341..18ff60c 100644 --- a/README.md +++ b/README.md @@ -1,7 +1,7 @@ # OS_Simulation Created for Operating System Simulation(CSE316) -Que. Consider a scheduling approach which is non pre-emptive similar to shortest job next in nature. The priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement. The jobs that have spent a long time waiting compete against those estimated to have short run times. The priority can be computed as : +Que. Consider a scheduling approach which is non pre-emptive similar to shortest job next in nature. The priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement. The jobs that have spent a long time waiting compete against those estimated to have short run times. The priority can be computed as follow : Priority = 1+ Waiting time / Estimated run time From c08cd1d23d3df47ae03adceb32363ef3f3d58110 Mon Sep 17 00:00:00 2001 From: Shivam2510 <43674275+Shivam2510@users.noreply.github.com> Date: Fri, 2 Oct 2020 12:13:30 +0530 Subject: [PATCH 2/2] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 18ff60c..759c846 100644 --- a/README.md +++ b/README.md @@ -1,5 +1,5 @@ # OS_Simulation -Created for Operating System Simulation(CSE316) +Created for Operating System Simulation-(CSE316) Que. Consider a scheduling approach which is non pre-emptive similar to shortest job next in nature. The priority of each job is dependent on its estimated run time, and also the amount of time it has spent waiting. Jobs gain higher priority the longer they wait, which prevents indefinite postponement. The jobs that have spent a long time waiting compete against those estimated to have short run times. The priority can be computed as follow : Priority = 1+ Waiting time / Estimated run time