Maximum satisfiability formulation for optimal scheduling in overloaded real-time systems

Xiaojuan Liao, Hui Zhang, Miyuki Koshimura, Rong Huang, Wenxin Yu

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

In real-time systems where tasks have timing requirements, once the workload exceeds the system’s capacity, missed deadlines may incur system overload. Finding optimal scheduling in overloaded real-time systems is critical in both theory and practice. To this end, existing works have encoded scheduling problems as a set of first-order formulas that might be tackled by the Satisfiability Modulo Theory (SMT) solver. In this paper, we move one step forward by formulating the scheduling dilemma in overloaded real-time systems as a Maximum Satisfiability (MaxSAT) problem. In the MaxSAT formulation, scheduling features are encoded as hard constraints and the task deadlines are considered soft ones. An off-the-shelf MaxSAT solver is employed to satisfy as many deadlines as possible, provided that all the hard constraints are met. Our experimental results show that our proposed MaxSAT-based method found optimal scheduling significantly more efficiently than previous works.

本文言語英語
ホスト出版物のタイトルPRICAI 2019
ホスト出版物のサブタイトルTrends in Artificial Intelligence - 16th Pacific Rim International Conference on Artificial Intelligence, Proceedings
編集者Abhaya C. Nayak, Alok Sharma
出版社Springer Verlag
ページ618-631
ページ数14
ISBN(印刷版)9783030299071
DOI
出版ステータス出版済み - 2019
イベント16th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2019 - Yanuka Island, フィジー諸島
継続期間: 8 26 20198 30 2019

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11670 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

会議

会議16th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2019
Countryフィジー諸島
CityYanuka Island
Period8/26/198/30/19

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Maximum satisfiability formulation for optimal scheduling in overloaded real-time systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル