Mammeri, Scheduling in Real-Time Sys- tems. Wiley, 2002.Francis C., Claude K., and Zoubir M., "Scheduling in Real-Time Systems," Wiley, New York, 2002.F. Cottet, J. Delacroix, C. Kaiser, and Z. Mammeri. Scheduling in Real-Time Systems. Wiley, West Sussex, England, 2002....
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems Summary: This paper describes a heuristic approach for solving the problem of dynamically scheduling tasks in a real-time system where tasks have deadlines... Z Wei,K Ramamritham,John A. Stankovic - 《IEEE Transactions on ...
There are two groups of task scheduling algorithms in real-time systems. The first group contains algorithms that have constant asymptotic time complexity and thus these algorithms lead to deterministic task switch duration but smaller theoretical CPU utilisation. The second group contains complex algorith...
Finding feasible schedules for tasks running in hard, real-time distributed computing systems is generally NP-hard. This paper describes a heuristic algorithm using evolutionary strategies. Our results indicate that the evolutionary strategies can find feasible schedules (assuming they exist) in very shor...
Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems S. Gosh et al., “Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems,” IEEE Trans. Parallel and Dist. Syst... S Ghosh,R Melhem,D Mosse - 《IEEE ...
This paper addresses the problem of scheduling aperiodic tasks in real-time systems. The proposed scheme combines the Earliest-Deadline-First algorithm for... N Homayoun,P Ramanathan - Real-Time Systems 被引量: 68发表: 1994年 Fixed-priority scheduling of real-time systems using utilization bounds...
Power Aware Scheduling for AND/OR Graphs in Real-Time Systems. Melhem, Power aware scheduling for AND/OR graphs in real-time systems, IEEE Transactions on Parallel and Distributed Systems, 15(9), pp. 849-864, ... D Zhu,Mossé,Daniel,... - 《IEEE Transactions on Parallel & Distributed ...
Scheduling in Hard Real-Time Applications 来自 Semantic Scholar 喜欢 0 阅读量: 31 作者:Z Jiang,TG Lewis 摘要: A major problem with hard real-time systems is how to be assured that they really work. The authors present theorems to extract timing information from a design diagram and then ...
A major challenge addressed by conventional database systems has been to efficiently implement the transaction model, which provides the properties of atomicity, serializability, and permanence. Real-time applications have added a complex new dimension to this challenge by placing deadlines on the respons...
Scheduling Hard Real-Time Systems hard real-time systemsmultiprocessor systemsperiodic processesResults of the application of scheduling theory to hard real-time systems are reviewed in this ... A Burns - 《Software Engineering Journal》 被引量: 474发表: 1991年 Fault-Tolerant Rate-Monotonic First-Fi...