Aperiodic Servers with Resource Constraints

  • Authors:
  • Marco Caccamo;Lui Sha

  • Affiliations:
  • -;-

  • Venue:
  • RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

Integrating soft and hard activities in a real-timeEnvironment has been an active area of research bothUnder fixed priority scheduling and dynamic priorityscheduling.Most of the existing work, however, hasbeen done under the assumption that soft real-timetasks and hard real-time tasks are independent.Thepaper presents an e脝cient method that allows soft real-time a periodic tasks and hard real-time tasks to shareresources.