In computer science, round robin is the name for a type of algorithm. The name might make one think of round-robin storytelling, which is a kind of storytelling where everyone present has an equal chance to contribute to the creation of the tale: they all get to have their input.
Something similar happens with the round-robin concept in the realm of computer science. With round-robin scheduling, each task receives a specific turn and time slot. No single process or task hogs all of the attention, just as, in round-robin story storytelling, no single person gets to take over and create the entire story on their own.
Again, when it comes to round-robin scheduling, each task is given a certain amount of CPU time. When a task’s CPU time is up, the next task takes over, and the task that was just being performed heads to the back of the line. The process now at the back of the line can begin again once when it becomes its turn again. No process is able to carry on until completion, which goes back to round-robin storytelling in that no one person can carry the story all the way to the end. Instead, the tasks stop when it’s no longer their turn and pick up where they left off when it’s their turn again.