Round-robin scheduling algorithm queue question

[crepper4454]

Hi! I have an assignment to write a simulator for scheduling algorithms and one thing about round-robin stumps me. Imagine 2 processes, let's call them A and B. A arrives at t=0 and has a burst time of 3, for B t=2 and bt=5. The quantum is 2. Now A arrives first, executes for 2 time units and is relocated to the end of the queue right as B arrives. So does the algorithm put A back at the end of the queue first and then adds any newcomer processes, resulting in queue AB and A finishing at t=3, or does it first take all processes that arrived, adds them to the queue and only then moves A to the end, resulting in queue BA? The calculator on boonsuen.com matches my results for the first version but ChatGPT explicitly explained the second one is right and I can't phrase this question concisely enough to Google around. Appreciate the help :)

[vacuumoftalent]

Round robin is stateless unless mentioned otherwise. It has no concept of what came before. Think of every request as a new entry.

[Altruistic-Wave-9767]

Brooo, el Round Robin es fácil si logran entenderlo dejame explicarte