Reference : Optimal Priority Assignment for Real-Time Systems: A Coevolution-Based Approach

	Document type :	Scientific journals : Article
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/50804

Title :	Optimal Priority Assignment for Real-Time Systems: A Coevolution-Based Approach
Language :	English
Author, co-author :	Lee, Jaekwon [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SVV >]
	Shin, Seung Yeob [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SVV >]
	Nejati, Shiva [University of Ottawa, Canada > School of Electrical Engineering and Computer Science]
	Briand, Lionel [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SVV > ; University of Ottawa,Canada > School of Electrical Engineering and Computer Science]
Publication date :	6-Aug-2022
Journal title :	Empirical Software Engineering
Publisher :	Kluwer Academic Publishers
Volume :	27
Special issue title :	Advances in Search-Based Software Engineering
Peer reviewed :	Yes
Audience :	International
ISSN :	1382-3256
e-ISSN :	1573-7616
Country :	Netherlands
Keywords :	[en] Priority Assignment ; Schedulability Analysis ; Real-Time Systems ; Coevolutionary Search ; Search-Based Software Engineering
Abstract :	[en] In real-time systems, priorities assigned to real-time tasks determine the order of task executions, by relying on an underlying task scheduling policy. Assigning optimal priority values to tasks is critical to allow the tasks to complete their executions while maximizing safety margins from their specified deadlines. This enables real-time systems to tolerate unexpected overheads in task executions and still meet their deadlines. In practice, priority assignments result from an interactive process between the development and testing teams. In this article, we propose an automated method that aims to identify the best possible priority assignments in real-time systems, accounting for multiple objectives regarding safety margins and engineering constraints. Our approach is based on a multi-objective, competitive coevolutionary algorithm mimicking the interactive priority assignment process between the development and testing teams. We evaluate our approach by applying it to six industrial systems from different domains and several synthetic systems. The results indicate that our approach significantly outperforms both our baselines, i.e., random search and sequential search, and solutions defined by practitioners. Our approach scales to complex industrial systems as an offline analysis method that attempts to find near-optimal solutions within acceptable time, i.e., less than 16 hours.
Research centres :	Interdisciplinary Centre for Security, Reliability and Trust (SnT) > Software Verification and Validation Lab (SVV Lab) ; University of Luxembourg: High Performance Computing - ULHPC
Funders :	European Research Council (ERC) ; NSERC
Permalink :	http://hdl.handle.net/10993/50804
DOI :	10.1007/s10664-022-10170-1
Framework Programme / European Project :	H2020 ; 694277 - TUNE - Testing the Untestable: Model Testing of Complex Software-Intensive Systems

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access EMSE2022_priority_assignment.pdf Author postprint 2.69 MB View/Open

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map