answersLogoWhite

0


Best Answer

i like moldy Chess. cheese....shests

User Avatar

Wiki User

15y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is the Limitations of implementing non-preemptive SJF algorithm?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Can you give a C program about SJF algorithm?

no.


Turnaround Time in sjf preemptive algorithm?

muje pta hota tho ish site par kya karti


What is the code for shortest job first?

It is SJF.


What is difference between SJF and SRTF?

Bugger Off


Can starvation occurs in SJF?

yes in the preemptive sjf where every time the system recieve job shorter than the current it stop the current and start the new one


What is Short job first?

short job first (SJF) is a job scheduling algorithm where shorter jobs are favored for being serviced first. this increases the overall system's number of processed jobs but has the disadvantage that long jobs can face starvation in waiting state irrespective to their wait time..


Example of preemptive sjf scheduling?

find primitive sjf? with avg waiting time and TAW? P Bust TIme Arivel time p1 5 1 p2 3 0 p3 2 2 p4 4 3 p5 8 2


What do you understand by queue Discipline?

IN QUEueing theory,it is like how we serve people in waiting line --- 1.fcfs 2.round robin 3.sjf 4. siro 5.fifo


What relation between priority and shortest job first?

Priority scheduling is a CPU scheduling algorithm where each process has a priority associated with it. Shortest job first (SJF) is a scheduling algorithm where the process with the shortest burst time is scheduled first. The relationship between the two is that a priority scheduling algorithm can be used where the priority of a process is determined by its burst time, effectively making it similar to a shortest job first algorithm.


Where does one find a guide to assemble cantilever shelving?

Cantilever shelving installation and assembly guide can be found on Cisco Eagle, Rack Express, Steelking, Aasur Plus Inc, SJF Material Handling, and Go Bookee.


Comparison of FCFS SJF round robin algos?

FCFS = First Come First Serve SJF = Shortest Job First Round Robin = Skip from one job to the next giving each job an equal amount of processing time. (up to you or given) In an example: You have 4 jobs ahead of you. JobC, JobA, JobB, JobD and they were handed in to you, in that order. JobA will take 2 hours to do, JobB will take 1 hour, JobC will take 5 hours, and JobD will take 9 hours. FCFS, basically would mean you finish JobC first, since it came to you first. Then when JobC was done, you would work on JobA and so on. SJF, you would finish JobB first, then JobA, then JobC and then JobD. Round Robin, you would work on JobC for 1 hour, then JobA for 1 hour, then JobB for 1 hour and then JobD for 1 hour, and repeat.


Does the Motorola CLIQ 2 have roaming capabilites outside the coverage area?

flsflksajfljasklfj;lksjfl;sdjflasjofjsl;fjl;sajfldk;sjf;lasjfl;askjfl;aksjfopsijfl;jsdf;lsjadfl;jasoifjflasjfkl;asjf;isldjf;asljfopasjfjls;ajflskdjlasjflfhuihofjoph giouhsgusghsakldhfljksdhjlghkalshfl daldjfkaslldfjsadfj.sajdfas;ldfj;alsfdlflsdkajfd