DETERMINING REAL-TIME PROCESSING RESERVE IN MULTITASKING SYSTEMS

Proceedings of 14th Digital Avionics Systems Conference Pub Date : 1995-11-05 DOI:10.1109/DASC.1995.482915

J. Preston, Paul A. Little, L. Martin

{"title":"DETERMINING REAL-TIME PROCESSING RESERVE IN MULTITASKING SYSTEMS","authors":"J. Preston, Paul A. Little, L. Martin","doi":"10.1109/DASC.1995.482915","DOIUrl":null,"url":null,"abstract":"The ability to accurately predict usable processing reserve is needed in many real-time software applications. Earlier research has shown that there are limits on the amount of available processor throughput that can be used to perform work with hard real-time deadlines. In this paper, we present an approach for determining and manipulating usable real-time processing reserve for multitasking systems that use preemptive, priority-based scheduling rules. Such systems must be prioritized using either rate monotonic, or deadline monotonic criteria. The approach computes real-time processing reserve for a schedulable task set, assuming that additional computation requirements will be levied on existing tasks. The approach includes a method for computing the maximum work that can be performed by an added task while preserving schedulability of the task set. Additionally, we introduce a method for balancing work within a task set to increase available real-time processing reserve. The method can be conditionally applied to harmonic tasks within a task set to improve the work efficiency of a processing resource.","PeriodicalId":125963,"journal":{"name":"Proceedings of 14th Digital Avionics Systems Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 14th Digital Avionics Systems Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.1995.482915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

The ability to accurately predict usable processing reserve is needed in many real-time software applications. Earlier research has shown that there are limits on the amount of available processor throughput that can be used to perform work with hard real-time deadlines. In this paper, we present an approach for determining and manipulating usable real-time processing reserve for multitasking systems that use preemptive, priority-based scheduling rules. Such systems must be prioritized using either rate monotonic, or deadline monotonic criteria. The approach computes real-time processing reserve for a schedulable task set, assuming that additional computation requirements will be levied on existing tasks. The approach includes a method for computing the maximum work that can be performed by an added task while preserving schedulability of the task set. Additionally, we introduce a method for balancing work within a task set to increase available real-time processing reserve. The method can be conditionally applied to harmonic tasks within a task set to improve the work efficiency of a processing resource.

查看原文本刊更多论文

确定多任务系统中的实时处理储备

在许多实时软件应用中，需要准确预测可用处理储量的能力。早期的研究表明，用于执行具有硬实时截止日期的工作的可用处理器吞吐量是有限的。在本文中，我们提出了一种确定和操纵多任务系统可用的实时处理储备的方法，该方法使用抢占式的、基于优先级的调度规则。这样的系统必须使用速率单调或截止时间单调标准进行优先级排序。该方法计算可调度任务集的实时处理预留，假设对现有任务征收额外的计算需求。该方法包括一种在保持任务集可调度性的情况下计算添加任务可执行的最大工作量的方法。此外，我们还介绍了一种在任务集中平衡工作的方法，以增加可用的实时处理储备。该方法可以有条件地应用于任务集中的谐波任务，以提高处理资源的工作效率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of 14th Digital Avionics Systems Conference

自引率

0.00%

发文量