Aperiodic servers with resource constraints

Marco Caccamo, Lui Sha

Research output: Contribution to journalArticlepeer-review


Integrating soft and hard activities in a real-time environment has been an active area of research both under fixed priority scheduling and dynamic priority scheduling. Most of the existing work, however, has been done under the assumption that soft real-time tasks and hard real-time tasks are independent. The paper presents an efficient method that allows soft real-time aperiodic tasks and hard real-time tasks to share resources.

Original languageEnglish (US)
Pages (from-to)161-170
Number of pages10
JournalProceedings - Real-Time Systems Symposium
StatePublished - 2001

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Aperiodic servers with resource constraints'. Together they form a unique fingerprint.

Cite this