An optimal resource sharing protocol for generalized multiframe tasks

Pontus Ekberg, Nan Guan, Martin Stigge, Wang Yi

Research output: Journal article publicationJournal articleAcademic researchpeer-review

12 Citations (Scopus)


Abstract Many different task models of varying expressiveness have been proposed to capture the timing constraints of real-time workloads. However, techniques for optimal scheduling and exact feasibility analysis of systems with mutually-exclusive shared resources have been available only for relatively simple task models, such as the sporadic task model. We consider sharing of mutually-exclusive resources in task models that are more expressive in terms of the job-release patterns that can be modeled. We propose a new scheduling algorithm and show that it is optimal for scheduling generalized multiframe tasks with shared resources on uniprocessor systems. We also present an efficient feasibility test for such systems, and show that it is both sufficient and necessary.
Original languageEnglish
Article number23
Pages (from-to)92-105
Number of pages14
JournalJournal of Logical and Algebraic Methods in Programming
Issue number1
Publication statusPublished - 8 Aug 2015
Externally publishedYes


  • Real-time
  • Resource sharing
  • Scheduling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Logic
  • Computational Theory and Mathematics


Dive into the research topics of 'An optimal resource sharing protocol for generalized multiframe tasks'. Together they form a unique fingerprint.

Cite this