FEASIBILITY ANALYSIS OF PERIODIC MULTIFRAME TASKS

HUANG Wenguang, YU Shiqi. FEASIBILITY ANALYSIS OF PERIODIC MULTIFRAME TASKSJ. Journal of Computer Research and Development, 2001, 38(2): 240-245.

Citation:

HUANG Wenguang, YU Shiqi. FEASIBILITY ANALYSIS OF PERIODIC MULTIFRAME TASKSJ. Journal of Computer Research and Development, 2001, 38(2): 240-245.

Citation:

HUANG Wenguang, YU Shiqi. FEASIBILITY ANALYSIS OF PERIODIC MULTIFRAME TASKSJ. Journal of Computer Research and Development, 2001, 38(2): 240-245.

Abstract

In this paper the schedulibility of the periodic multiframe tasks in a preemptive fixed priority scheduling algorithm is discussed. It is proved that the DM scheduling algorithm is not optimal for periodic multiframe tasks, but it is optimal for accumulating monotonic periodic multiframe tasks.

FullText(HTML)

Turn off MathJax

Article Contents

Export File