Round-robin scheduling
Algorithm employed by process and network schedulers in computing
Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive).
Nº Q1196582 ★★
Uncommon · Knowledge
Round-robin scheduling
Algorithm employed by process and network schedulers in computing
Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive).
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices (also known as time quanta) 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 be applied to other scheduling problems, such as data packet scheduling in computer networks. It is an operating system concept. The name of the algorithm comes from the round-robin principle known from other fields, where each person takes an equal share of something in turn.
Text: Wikipédia, CC BY-SA 4.0. · Image: Ben Meiri (CC BY-SA 4.0) ·
Related cards
Shunting yard algorithm
Stack-based algorithm for parsing infix mathematical expression
Nº Q1199602 ★★
R-tree
Tree-based data structure, used to index spatial information
Nº Q1198051 ★★
Gram–Schmidt process
Method for orthonormalising a set of vectors
Nº Q475239 ★★★
Turing completeness
Ability of a computing system to simulate Turing machines
Nº Q197970 ★★★
Divide-and-conquer algorithm
Algorithm design paradigm based on multi-branched recursion
Nº Q671298 ★★
Hill climbing
Optimization algorithm
Nº Q820272 ★