Answer:- Priority scheduling is a more general case of SJF, in which each job is
assigned a priority and the job with the highest priority gets scheduled first.
(SJF uses the inverse of the next expected burst time as its priority – The smaller
the expected burst, the higher the priority.) Note that in practice, priorities
are implemented using integers within a fixed range, but there is no
agreed-upon convention as to whether “high” priorities use large numbers or small
numbers. The book uses low numbers for high priorities, with 0 being the
highest possible priority.
Post a Comment