round-robin scheduling


round-robin scheduling

[′rau̇nd ¦räb·ən ′skej·ə·liŋ] (computer science) A scheduling algorithm which repeatedly runs through a list of users, giving each user the opportunity to use the central processing unit in succession.