H-FSC Scheduling Algorithm

• Approximates H-FSC model by

  • resolving conflicts in favor of real-time requirements for leaf classes
  • minimizing discrepancy between service each class should ideally receive and the service it actually receives

• Based on two criteria

  • real-time: guarantee service curves of all leaf classes
  • link-sharing: guarantee service curves of interior classes and distribute excess service fairly
  • whenever there is a potential of conflict, real-time criteria is used

Previous slide

Next slide

Back to first slide

View graphic version