ABSTRACT:

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
also be applied to other scheduling problems, such as data
packet scheduling in computer networks. It is an operating
system concept.A round-robin tournament (or all-play-all
tournament) is a competition in which each contestant meets
all other contestants in turn. A round-robin contrasts with
an elimination tournament, in which participants are eliminated
after a certain number of losses. In theory, a round-robin
tournament is the fairest way to determine the champion from
among a known and fixed number of contestants. Each
contestant, whether player or team, has equal chances against
all other opponents because there is no prior seeding of
contestants that will preclude a match between any given pair.
The element of luck is seen to be reduced as compared to
a knockout system since one or two bad performances need
not cripple a competitor's chance of ultimate
victory.[dubious – discuss] Final records of participants are
more accurate as they represent the results over a longer
period against the same opposition. This can also be used to
determine which teams are the poorest performers and thus
subject to relegation if the format is used in a multi-tiered
league. This is also helpful to determine the final rank of all
competitors, from strongest to weakest, for purposes of
qualification for another stage or competition as well as for
prize money. In team sport the (round-robin) major league
champions are generally regarded as the "best" team in the
land, rather than the (elimination) cup winners.