Fast scheduling of periodic tasks on multiple resources

  • Authors:
  • Sanjoy K. Baruah;Johannes Gehrke;C. Greg Plaxton

  • Affiliations:
  • -;-;-

  • Venue:
  • IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
  • Year:
  • 1995

Quantified Score

Hi-index 0.01

Visualization

Abstract

Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of the periodic scheduling problem, and runs in O(min{mlgn,n}) time per slot scheduled.