Abstract

For embedded systems, there are two cases of using an operating system and not using an operating system. When the real-time task is accomplished by the embedded system of the operating system, the task needs to meet certain conditions and occupy part of the processor's resources. Therefore, based on the method of event interruption, timed interruption and task decomposition, the real-time performance of the completion of the task of the embedded system is achieved. Finally, an embedded radar track compression scheduling algorithm is designed. It is proved through experiment that the track data can be compressed and transmitted in real time.

Highlights

  • The problem of multitasking processing lies mainly in the scheduling among different tasks [1]

  • According to the nature of the task can be divided into static scheduling and dynamic scheduling

  • Dynamic Scheduling According to the priority of dynamic task assignment during task execution, EDF (Earliest Deadline First) is a typical dynamic scheduling algorithm that schedules tasks based on task deadline [4]

Read more

Summary

INTRODUCTION

The problem of multitasking processing lies mainly in the scheduling among different tasks [1]. The current scheduling algorithms are mostly used directly in the operating system, but the use of the operating system often requires tasks to meet certain requirements in terms of periodicity, execution time, etc. By analyzing the method of task scheduling in the operating system, it is directly applied in the embedded system to achieve real-time balanced scheduling of tasks. It is used in target track compression. Experiments have proved that real-time compression of the target track can be achieved

REAL-TIME BALANCED SCHEDULING ALGORITHM
COMPRESSED RADAR TRACK SCHEDULING ALGORITHM
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call