|Table of Contents|

Research on Guaranteed Scheduling Algorithms(PDF)

Transactions of Tianjin University[ISSN:1006-4982/CN:12-1248/T]

Issue:
2002年01期
Page:
48-51
Publishing date:

Info

Title:
Research on Guaranteed Scheduling Algorithms
Author(s):
ZHANG Feng zhi 1 ZHANG Hong xian 1 ZONG Run kuan 2 REN Chang ming 1
(1. School of Electronic Information Engineering , Tianjin University ,Tianjin 300072,China; 2. School of Chemical Engineering and Technology, Tianjin University,Tianjin 300072
Keywords:
DOI:

Abstract:
Guaranteed scheduling is necessary for hard real time systems, because each process of them must meet their deadline, or a serious consequence will result.In this paper we discuss two guaranteed schedule algorithms:backtracking and branch and bound,introduce the process to find the optimal solution by both methods,propose the concept of logical node and physical node.Through some experiments for different process sets,we have made comparisons between the two algorithms in branch nodes,comparing time,topology of the search tree,memory size needed,etc.

References

Memo

Memo:
-
Last Update: 2011-05-02