Research on Guaranteed Scheduling Algorithms
有保证调度算法的研究(英文)作者机构：天津大学电子信息工程学院天津300072 天津大学化工学院天津300072
出 版 物：《Transactions of Tianjin University》 (天津大学学报（英文版）)
年 卷 期：2002年第8卷第1期
页 面：48-51页
学科分类：08[工学] 0835[工学-软件工程] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）]
主 题：hard real time systems branch and bound backtracking guaranteed scheduling
摘 要：Guaranteed scheduling is necessary for hard real time systems, because each process of them must meet their deadline, or a serious consequence will *** 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 *** 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.
维普期刊数据库
同方期刊数据库