ScholarLens Back to search
2013•Russian Electrical EngineeringRequires access

Scheduling aperiodic requests in the presence of hard real-time tasks with linear timing constraints

М. В. Кавалеров, Н. Н. Матушкин

Open publisher page 0 citations

Abstract

This paper considers the problem of scheduling aperiodic requests in the presence of hard real-time tasks with linear timing constraints. This problem may arise when designing control real-time systems. A scheduling algorithm for aperiodic requests that can reduce the average aperiodic response time in comparison with the Slack Stealing algorithm is proposed. The proposed algorithm is based on the fact that it considers initial real-time constraints belonging to a class of linear timing constraints and thereby prolongs the deadlines of hard real-time requests, which frees up additional time for execution of aperiodic requests.

About this research paper

What this paper is about

This paper considers the problem of scheduling aperiodic requests in the presence of hard real-time tasks with linear timing constraints. This problem may arise when designing control real-time systems. A scheduling algorithm for aperiodic requests that can reduce the average aperiodic response time in comparison with the Slack Stealing algorithm is proposed. The proposed algorithm is based on the fact that it considers initial real-time constraints belonging to a class of linear timing constraints and thereby prolongs the deadlines of hard real-time requests, which frees up additional time for execution of aperiodic requests.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper considers the problem of scheduling aperiodic requests in the presence of hard real-time tasks with linear timing constraints. This problem may arise when designing control real-time systems. A scheduling algorithm for aperiodic requests that can reduce the average aperiodic response time in comparison with the Slack Stealing algorithm is proposed. The proposed algorithm is based on the fact that it considers initial real-time constraints belonging to a class of linear timing constraints and thereby prolongs the deadlines of hard real-time requests, which frees up additional time for execution of aperiodic requests.

Key concepts: Aperiodic graph, Scheduling (production processes), Computer science, Real-time computing, Response time, Time complexity, Distributed computing, Parallel computing

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Scheduling aperiodic requests in the presence of hard real-time tasks with linear timing constraints — Research Paper | ScholarLens