one common method of logically implementing the fair-share scheduling strategy is to recursively apply the round-robin scheduling strategy at each level of abstraction (processes, users, groups, etc.) the time quantum required by round-robin is arbitrary, as any equal division of time will produce the same results.