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.
