检索结果-内蒙古大学图书馆

A PRE-RUN-TIME scheduling algorithm FOR HARD REAL-TIME SYSTEMS

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1991年第7期17卷 669-677页

作者： SHEPARD, T GAGNE, JAM CFB COLD LAKE WEAPONS SYST SOFTWARE UNITMEDLEY TOA 2MOALBERTACANADA

Process scheduling is an important issue in the design and maintenance of hard real-time (HRT) systems. The primary objective of scheduling is to provide a feasible process allocation and sequencing. In this paper we present a prerun-time scheduling algorithm which addresses the problem of process sequencing. The algorithm is designed for multiprocessor applications with preemptable processes having release times, computation times, deadlines, and arbitrary precedence and exclusion constraints. The algorithm uses a branch and bound (B&B) implicit enumeration technique to generate a feasible schedule for each processor. The set of feasible schedules ensures that the timing specifications of the processes are observed, and that all the precedence and exclusion constraints between pairs of processes are satisfied. The algorithm was tested using a model derived from the F-18 Mission Computer (MC) Operational Flight Program (OFP). The feasibility of using the algorithm to derive processor utilization factors and to assess the software growth capability of the system is also demonstrated, again using the model. The high cost that would be incurred to reimplement the OFP precluded the application of the algorithm to the actual software in the F-18.

关键词： PRE-RUN-TIME scheduling HARD REAL-TIME SYSTEMS branch and bound scheduling algorithm AVIONICS SYSTEMS MULTIPROCESSORS MUTUAL EXCLUSION PRECEDENCE CONSTRAINTS SOFTWARE MAINTENANCE

来源：评论

学校读者我要写书评

暂无评论

Comment on a pre-run-time scheduling algorithm for hard real-time systems

引用

IEEE Transactions on Software Engineering 1997年第9期23卷 599-600页

作者： Abdelzaher, Tarek F. Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109 United States

In Shepard and Gagne [1], a branch-and-bound implicit enumeration algorithm is described whose purpose is to generate a feasible schedule, if any, for each processor on a multiprocessing node running hard real-time processes. The optimization criterion is to minimize process lateness defined as the difference between the process completion time and deadline. We show in this correspondence that this algorithm does not always succeed in finding a feasible solution, and describe the reason why the algorithm might fail. © 1997 IEEE.

关键词： branch and bound scheduling algorithm Hard real-time systems Multiprocessors Pre-run-time scheduling Precedence constraints

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：