Bounding carry-in interference to improve fixed-priority global multiprocessor scheduling analysis

Nan Guan, Meiling Han, Chuancai Gu, Qingxu Deng, Wang Yi

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

8 Citations (Scopus)

Abstract

The analysis of global multiprocessor scheduling is more difficult than its uniprocessor counterpart. Due to the unknown critical instant, existing techniques use overapproximations of task interference for efficient yet pessimistic analysis. In this paper, we proposed a new technique to improve the precision of interference estimation. The key is to identify and resolve contradicting assumptions made in the analysis procedure. The resulting new analysis method improves the analysis precision at the price of a higher complexity. Then we introduce techniques to optimize the new method for better efficiency. Experiments with randomly generated task sets are conducted to evaluate both the precision and efficiency of the proposed new method.
Original languageEnglish
Title of host publicationProceedings - IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2015
PublisherIEEE
Pages11-20
Number of pages10
ISBN (Electronic)9781467378550
DOIs
Publication statusPublished - 1 Jan 2015
Externally publishedYes
EventIEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2015 - Hong Kong, Hong Kong
Duration: 19 Aug 201521 Aug 2015

Conference

ConferenceIEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2015
CountryHong Kong
CityHong Kong
Period19/08/1521/08/15

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this