Schedulability analysis of global fixed-priority or EDF multiprocessor scheduling with symbolic model-checking

Nan Guan, Zonghua Gu, Mingsong Lv, Qingxu Deng, Ge Yu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

20 Citations (Scopus)

Abstract

As Moore's law comes to an end, multi-processor (MP) systems are becoming increasingly important in embedded systems design, hence real-time schedulability analysis for MP systems has become an important research topic. In this paper, we present an exact method for schedulability analysis of global multiprocessor scheduling with either Fixed-Priority (FP) or Earliest-Deadline-First (EDF) algorithms using the model-checker NuSMV. Compared to safe but pessimistic schedulability tests based on processor utilization bounds, model-checking can provide an exact answer to the schedulability of a taskset, as well as quantitative information on each task's best-case and worst-case response times.
Original languageEnglish
Title of host publicationProceedings - 11th IEEE Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2008
Pages556-560
Number of pages5
DOIs
Publication statusPublished - 22 Aug 2008
Externally publishedYes
Event11th IEEE Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2008 - Orlando, FL, United States
Duration: 5 May 20087 May 2008

Conference

Conference11th IEEE Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2008
CountryUnited States
CityOrlando, FL
Period5/05/087/05/08

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Software

Cite this