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

SICE 2003 Annual Conference

作者： El-Haweet, WA El-Meligy, HH Abd El-Salam, I Alexandria Univ Fac Engn Comp Sci & Automat Control Dept Alexandria Egypt

ISBN: (纸本)0780383524

Directed Acyclic Graphs DAGs are used to represent AND/OR precedence constraint systems where AND tasks are ready to execute when all of their direct predecessors are completed and OR tasks are ready to execute when one or more but not necessarily all of their direct predecessors are completed. A proposed Imprecise Computation Technique ICT is introduced to maximize the solution quality within the available time. To examine and evaluate ICT, a Random Graph Generator algorithm RGG is created to provide a wide range of random DAGs to be used in the simulation experiments.

关键词： AND/OR precedence constraints directed acyclic graphs skipped and unskipped scheduling imprecise computation dependability design-to-time real-time scheduling

来源：评论

学校读者我要写书评

暂无评论

Imprecise computation technique to schedule AND/OR tasks with global end-to-end deadline in distributed real-time systems

引用

AEJ - Alexandria Engineering Journal 2003年第5期42卷 577-587页

作者： El-Haweet, Wafaa A. El-Meligy, Hanan H. Abd, El-Salam, Ibrahim Comp. Sci. and Automat. Cntr. Dept. Alexandria University Alexandria Egypt

In a real-time system, tasks must produce logically correct results by their deadlines. These tasks usually don't need to be executed in a sequential order. Rather, certain precedence constraints must be handled between them along with timing constraints to provide correct scheduling and consequently correct execution. In traditional precedence-constrained scheduling, a task is ready to execute when all of its direct predecessors are completed. Such task is called an AND task. In many applications, some tasks are ready to execute when one or more but not necessarily all of their direct predecessors are completed. These tasks are called OR tasks. The resultant system containing both AND and OR tasks is said to have AND/OR precedence constraints. Directed Acyclic Graphs DAGs are used to represent these systems. This paper introduces a method to combine both precedence constraints and timing constraints into the same scheduling problem. Timing constraints here are in the form of a global End-to-End Deadline EED between a start task and an end task of the AND/OR graph representing the task system. A proposed Imprecise Computation Technique ICT is introduced to maximize the solution quality within the available time. ICT is motivated by the fact that one can trade off precision with timeliness;it prevents the total processing time of the system from stretching over the EED. To examine and evaluate this proposed imprecise scheduling solution, a Random Graph Generator algorithm RGG is created to provide a wide range of random DAGs to be used in the simulation experiments.

关键词： AND/OR precedence constraints Dependability design-to-time real-time scheduling Directed acyclic graphs Imprecise computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：