PROCESS SCHEDULING

Balaji Jegan asked Oct 12, 2018

1,205 views

See all

Please log in or register to answer this question.

Related questions

1 votes

2 answers

delxbydelt asked Mar 15

272 views

OS, Process Scheduling
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process requires kx seconds to complete and the context switch takes 0 seconds. At what time the first process will complete the execution? (assume all the variables as integers). A) nkx B) k(nx-1) C) k(nk+n) D) x(nk-n+1)

Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process require...

delxbydelt

272 views

delxbydelt asked Mar 15

0 votes

1 answer

Mukesh_Kumar asked Dec 30, 2023

627 views

Let there are 4 processes P1, P2, P3 and P4 whose arrival time is 0 milliseconds and CPU burst time are 6, 8, 7 and 3 milliseconds respectively. If the operating system uses shortest job first scheduling algorithm, then the difference between waiting time of process P3 and P₁ is 1) 3 milliseconds 2) 6 milliseconds 3) 9 milliseconds 4) 12 milliseconds

Mukesh_Kumar

627 views

Mukesh_Kumar asked Dec 30, 2023

0 votes

1 answer

Nam14 asked Apr 5, 2023

530 views

Abraham Silberschatz, Greg Gagne, Peter B. Galvin - Operating System Concepts-Wiley (2018), PART TWO PROCESS MANAGEMENT, Chapter 5 CPU Scheduling, Pg. 202.

Please read below passage from 10th edition Operating System Concepts, pg. 202:5.1.3 Preemptive and Nonpreemptive SchedulingCPU-scheduling decisions may take place under ...

Nam14

530 views

Nam14 asked Apr 5, 2023

2 votes

0 answers

Raviwarlord asked Nov 18, 2022

391 views

Longest Remaining time first Process scheduling.
Why do we say that Longest Remaining time first is a starvation free algorithm? Let me walk through my though process, same as LRTF is Shortest Remaining time first and it is given that (in multiple standard books) SRTF may ... never keep on coming. Please can anyone clarify me about the logic about why LRTF are considered starvation free algorithms.

Why do we say that Longest Remaining time first is a starvation free algorithm?Let me walk through my though process, same as LRTF is Shortest Remaining time first and it...

Raviwarlord

391 views

Raviwarlord asked Nov 18, 2022

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

PROCESS SCHEDULING

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

0