A Measurement-Based Model for Parallel Real-Time Tasks
A Measurement-Based Model for Parallel Real-Time Tasks
复制标题
基于测量的并行实时任务模型
DOI：
10.4230/lipics.ecrts.2018.5
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Sanjoy Baruah
中科院分区：
文献类型：
--
作者：
Kunal Agrawal;Sanjoy Baruah
在多处理器调度的联合范例下，为每个实时任务的独占使用预留了一组处理器。如果任务的特征非常保守(这在安全关键型系统中是典型的)，则很可能大多数任务调用的计算需求将远远低于最坏情况特征，并且假设其运行时行为的最坏情况特征，则可以在比分配给它的处理器少得多的处理器上正确地调度任务。如果我们可以在运行时安全地确定何时需要所有处理器，那么在剩下的时间里，不需要的处理器可以空闲在低能量“休眠”模式中，或者用于在后台执行非实时工作。在本文中，我们提出了一个以允许我们这样做的方式来表示可并行化实时任务的模型。我们的模型不要求我们对任务所表示的代码的内部结构有细粒度的了解；相反，它通过在不同条件下重复执行代码并测量运行时而获得的一些参数来描述每个任务。2012年ACM学科分类计算机系统组织→实时系统，软件及其工程→实时可调度性，计算理论→并行计算模型
Under the federated paradigm of multiprocessor scheduling, a set of processors is reserved for the exclusive use of each real-time task. If tasks are characterized very conservatively (as is typical in safety-critical systems), it is likely that most invocations of the task will have computational demand far below the worst-case characterization, and could have been scheduled correctly upon far fewer processors than were assigned to it assuming the worst-case characterization of its runtime behavior. Provided we could safely determine during run-time when all the processors are going to be needed, for the rest of the time the unneeded processors could be idled in low-energy “sleep” mode, or used for executing non-real time work in the background. In this paper we propose a model for representing parallelizable real-time tasks in a manner that permits us to do so. Our model does not require us to have fine-grained knowledge of the internal structure of the code represented by the task; rather, it characterizes each task by a few parameters that are obtained by repeatedly executing the code under different conditions and measuring the run-times. 2012 ACM Subject Classification Computer systems organization → Real-time systems, Software and its engineering → Real-time schedulability, Theory of computation → Parallel computing models