
Patrick B. answered 04/13/21
Math and computer tutor/teacher
Then the process shall receive more processing time than the others, which may be useful
if it is a priority queue
Shiky T.
asked 04/13/21In a round-robin scheduler, usually a ready queue contains all processes waiting for CPU burst time. Each process exists exactly once in the queue. Suppose that the scheduler allowed a process to exist more than once in the queue.
Patrick B. answered 04/13/21
Math and computer tutor/teacher
Then the process shall receive more processing time than the others, which may be useful
if it is a priority queue
Get a free answer to a quick problem.
Most questions answered within 4 hours.
Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.