Titlebook: Responsive Computing; A Special Issue of R Miroslaw Malek Book 1994 Springer Science+Business Media New York 1994 Area.Excel.Finite.algorit

Champion

http://image.papertrans.cn/r/image/828778.jpg

configuration

Acclaim

https://doi.org/10.1007/978-1-4615-2786-2Area; Excel; Finite; algorithms; computing system; constraint; field; monitor; monitoring; real-time; real-tim

很是迷惑

中古

尖牙

高歌

Compositional Reasoning about Responsive Systems with Limited Resources,ted. In this theory a conceptual scheduler grants the resource using on-line preemptive priority scheduling where the priority is a function of the initial priority and the time spent waiting for the resource. The method enables reasoning about responsive systems which must respond to external input

Adornment

Enhancing Fault-Tolerance in Rate-Monotonic Scheduling,g a set of tasks, each of which, for fault-tolerance purposes, has multiple versions, onto the minimum number of processors. On each individual processor, the tasks are guaranteed their deadlines by the Rate-Monotonic algorithm. A simple online allocation heuristic is proposed. It is proven that . ≤

貴族

Scheduling Algorithms for Fault-Tolerance in Hard-Real-Time Systems,proposed is evaluated in terms of the number of processors and the cost of the checkpoints needed. Moreover, analytical studies are used to reveal interesting trade-offs associated with the scheduling algorithms.

假裝是我

Enhancing Fault-Tolerance in Rate-Monotonic Scheduling,required to feasibly schedule the same set of tasks, and κ is the maximum redundancy degree a task can have. The bound is also shown to be a tight upper bound. The average-case performance of the heuristic is studied through simulation. It is shown that the heuristic performs surprisingly well on the average.