Analysis on Scheduling Algorithms of Real-Time Hybrid Tasks

Jian Lang Wu; Jing Kai Shi; Yi Bin Wang

doi:10.4028/www.scientific.net/AMM.644-650.2253

Paper Titles

Design of Household Heat Metering Management System Based on Cloud Computing
p.2235

A New Delegation Provable Data Possession in Public Cloud Storage
p.2239

Design of Tibetan Continuous Speech Corpus Based on Triphone
p.2245

Study of the Logistics Transportation Vehicle Terminal Path Optimization and Algorithm Based on GIS
p.2249

Analysis on Scheduling Algorithms of Real-Time Hybrid Tasks
p.2253

Estimate of the Interfacial Length Scale in Boiling Heat Transfer Simulation Based on Mixture Model
p.2258

Adaptive Genetic Algorithm Verification Technology Driven by Functional Coverage
p.2264

Artificial Society-Oriented Large-Scale Road Path Querying Methods
p.2269

Agricultural Logistics Companies Distribution Based on Fuzzy Clustering Analysis and Genetic Algorithm
p.2276

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 644-650Analysis on Scheduling Algorithms of Real-Time...

Analysis on Scheduling Algorithms of Real-Time Hybrid Tasks

Abstract:

In real-time systems, periodic tasks and aperiodic tasks exist simultaneously. In a uniprocessor system, mainly there are Deferrable Server algorithm (DS) [1], Slack Stealing algorithm (SSA) [2] and their extended version for software/hardware hybrid real-time task scheduling. DS algorithm sets a high priority periodic task server to provide services for aperiodic tasks, while SSA algorithm computes tasks unoccupied time offline, and then schedule aperiodic tasks during the unoccupied period. The two algorithms are both proposed for soft real-time tasks, reducing the response time of the real-time tasks, but cannot guarantee that these aperiodic real-time tasks received can meet deadlines. In this paper, through combination of DS algorithm and EDF (Earliest Deadline First) algorithm [6], a new algorithm called DS-EDF is introduced, which can scheduling hard real-time aperiodic tasks on the DS server. This algorithm is not only suitable for uniprocessor systems, but also has the ability to extend to multiprocessor systems.