4.8 Article

Integrated Scheduling of Real-Time and Interactive Tasks for Configurable Industrial Systems

Journal

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
Volume 18, Issue 1, Pages 631-641

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TII.2021.3067714

Keywords

Task analysis; Real-time systems; Job shop scheduling; Processor scheduling; Energy consumption; Nonvolatile memory; Voltage control; Genetic algorithm (GA); industrial system; interactive task; real-time task; task scheduling

Funding

  1. ICT R&D program of MSIP/IITP [2019-0-00074]
  2. National Research Foundation - Korea government (MSIP) [2019R1A2C1009275, TII21-0264]
  3. National Research Foundation of Korea [2019R1A2C1009275] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

Ask authors/readers for more resources

With the development of Internet of Things and cyber-physical systems technologies, the scheduling of tasks in smart industrial systems becomes more challenging due to the coexistence of interactive and real-time tasks. This article proposes a new task scheduling policy that uses virtual real-time tasks and two-phase scheduling to address this issue. Offline scheduling is performed based on genetic algorithms to determine the execution parameters for real-time tasks and reserve virtual real-time tasks for interactive tasks. Online scheduling is then carried out on the time slots of virtual real-time tasks to handle the arrival of interactive tasks. Experimental results show that the proposed policy significantly reduces energy consumption and ensures short waiting time for interactive tasks.
With the recent advances in Internet of Things and cyber-physical systems technologies, smart industrial systems support configurable processes consisting of human interactions as well as hard real-time functions. This implies that irregularly arriving interactive tasks and traditional hard real-time tasks coexist. As the characteristics of the tasks are heterogeneous, it is not an easy matter to schedule them all at once. To cope with this situation, this article presents a new task scheduling policy that uses the notion of virtual real-time task and two-phase scheduling. As hard real-time tasks must keep their deadlines, we perform offline scheduling based on genetic algorithms beforehand. This determines the processor's voltage level and memory location of each task and also reserves the virtual real-time tasks for interactive tasks. When interactive tasks arrive during the execution, online scheduling is performed on the time slot of the virtual real-time tasks. As interactive workloads evolve over time, we monitor them and periodically update the offline scheduling. Experimental results show that the proposed policy reduces the energy consumption by 66.8% on average without deadline misses and also supports the waiting time of less than 3 (s) for interactive tasks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available