Partitioned Real-Time Scheduling for Preventing Information Leakage

Donghwa Kang,Hyeongboo Baek,Kilho Lee,Inhwa Jung

doi:10.1109/access.2022.3154055

Abstract

Recent real-time systems have been gradually connected externally through the Internet. As each subsystem constituting a system has been developed from different vendors, the number of cases of security vulnerabilities in communication between subsystems has increased. In particular, real-time systems are vulnerable to timing inference attacks, such as cache-based side-channel attacks. Among the various methods for handling security problems of these systems, the flush task (FT) method is a simple and effective method to reduce the probability of information leakage by conditionally initializing the state of resources shared by tasks before a given scheduling. However, existing FT methods are for global scheduling only, and techniques for partitioned scheduling have not yet been studied. In this paper, we propose an FT-aware bin-packing (FT-bin-packing) algorithm that effectively allocates real-time tasks to identical multiprocessors to reduce the number of FTs invoked during the schedule of tasks in each processor. Based on the experimental results, we analyze the properties and performance of the FT-bin-packing algorithm. These results indicate that it can improve the performance of existing heuristic algorithms by up to 96.8% depending on the experimental setting.

Highlights

A system that is both functionally and temporally accurate is called a real-time system [1]
As the last part of FT-response time analysis (RTA), we examine how to upper-bound the number of flush tasks that can occur while the job of τk finishes executing
We measure the number of task sets deemed schedulable by the proposed heuristic algorithm 1 utilizing flush-task aware response-time analysis (FT-RTA)

Summary

Introduction

A system that is both functionally and temporally accurate is called a real-time system [1]. Recognition is made using LiDAR, radar, camera, etc., judgment is made using an internal computing system, and action is performed using a motor [2] These tasks are repeated with a cycle. If each task does not operate within a predefined time, called the deadline, it causes significant human and material damage. Complying with this deadline is called a real-time requirement, and meeting realtime requirements is a crucial concern in developing a realtime system. To satisfy real-time requirements in different fields, the real-time system community has been investigating how to allocate computing resources to real-time tasks and whether each task can complete execution within a deadline The former method is called a real-time scheduling algorithm, and the latter one is called real-time analysis [3], [4], [5]

Objectives

Results

Conclusion