Start time configuration for strictly periodic real-time task systems

Tianyu Zhang, Nan Guan, Qingxu Deng, Wang Yi

Research output: Journal article publicationJournal articleAcademic researchpeer-review

10 Citations (Scopus)


System designers need to assign time slots that are infinitely repeated given a strict period for each task such that the time slots of different tasks do not overlap. While previous work has studied how to decide if a system is schedulable with a certain time slot assignment, it is still an unexplored area of how to select time slots for strictly periodic tasks to make them schedulable. In this paper, we propose an efficient method to solve the above problem. Our method explores the relations among task periods to improve the possibility of finding feasible start time configurations. Finally, we conduct experiments with randomly generated workload to evaluate the performance of the proposed method.
Original languageEnglish
Pages (from-to)61-68
Number of pages8
JournalJournal of Systems Architecture
Publication statusPublished - 1 May 2016
Externally publishedYes


  • Embedded systems
  • Real-time systems
  • Schedulability analysis
  • Scheduling
  • Strictly periodic

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture


Dive into the research topics of 'Start time configuration for strictly periodic real-time task systems'. Together they form a unique fingerprint.

Cite this