Performance of real-time bus scheduling algorithms

  • Authors:
  • John P. Lehoczky;Lui Sha

  • Affiliations:
  • Department of Statistics, Carnegie-Mellon University, Pittsburgh, PA;Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA

  • Venue:
  • SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
  • Year:
  • 1986

Quantified Score

Hi-index 0.01

Visualization

Abstract

When periodic tasks with hard deadlines communicate over a bus, the problem of hard real-time bus scheduling arises. This paper addresses several problems of hard real-time bus scheduling, including the evaluation of scheduling algorithms and the issues of message packet pacing, preemption, priority granularity and buffering.