ラウンドロビン・スケジューリング
1. Round-robin schedulingRound-robin (RR) is one of the simplest scheduling algorithms for processes in an operating system. As the term is generally used, time slices are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin scheduling is simple, easy to implement, and starvation-free. Round-robin scheduling can also be applied to other scheduling problems, such as data packet scheduling in computer networks.
Read “Round-robin scheduling” on English Wikipedia
Read “ラウンドロビン・スケジューリング” on Japanese Wikipedia
Read “Round-robin scheduling” on DBpedia
Read “Round-robin scheduling” on English Wikipedia
Read “ラウンドロビン・スケジューリング” on Japanese Wikipedia
Read “Round-robin scheduling” on DBpedia
Discussions
Log in to talk about this word.