A note on preemptive scheduling of periodic, real-time tasks

Joseph Y.T. Leung, M. L. Merrill

Research output: Contribution to journalArticlepeer-review

272 Scopus citations
Original languageEnglish (US)
Pages (from-to)115-118
Number of pages4
JournalInformation Processing Letters
Volume11
Issue number3
DOIs
StatePublished - 1980
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Keywords

  • NP-completeness
  • Periodic real-time tasks
  • feasibility test
  • optimal scheduling algorithm

Cite this