Equivalence Class Scheduling

• Classes are assigned a weight based on size

  • weight = s ? (s - 1) / 2

• Sort classes based on weight

• Use greedy algorithm:

  • Max weight goes to least loaded proc

• Determining weight is not trivial

Previous slide

Next slide

Back to first slide

View graphic version