2003•Microcomputer DevelopmentRequires access

An Approach of Scheduled Test for Static-Priority Scheduling Algorithm

Hui Zhang

Abstract

The scheduling algorithm is an important technology for real time system,so the test of scheduling algorithm is needed. There are different test ways in different scheduling algorithms.A method is proposed ,based the response time of tasks in the worst condition for a simple real time model. Taken into account many factors in the complex model, the response time of tasks is modified and is used.

About this research paper

What this paper is about

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

Key concepts: Computer science, Rate-monotonic scheduling, Earliest deadline first scheduling, Fair-share scheduling, Dynamic priority scheduling, Algorithm, Response time, Two-level scheduling