期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
An Efficient Real-Time Fault-Tolerant Scheduling Algorithm Based on Multiprocessor Systems 被引量:6
1
作者 YANG Fumin LUO Wei PANG Liping 《Wuhan University Journal of Natural Sciences》 CAS 2007年第1期113-116,共4页
In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible... In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible because it can take the advantages of backup copy de-allocation technique and overloading technique to improve schedulability. In this paper, we propose a novel efficient fault-tolerant ratemonotonic best-fit algorithm efficient fault-tolerant rate-monotonic best-fit (ERMBF) based on multiprocessors systems to enhance the schedulability. Unlike existing scheduling algorithms that start scheduling tasks with only one processor. ERMBF pre-allocates a certain amount of processors before starting scheduling tasks, which enlarge the searching spaces for tasks. Besides, when a new processor is allocated, we reassign the task copies that have already been assigned to the existing processors in order to find a superior tasks assignment configuration. These two strategies are all aiming at making as many backup copies as possible to be executed as passive status. As a result, ERMBF can use fewer processors to schedule a set of tasks without losing real-time and fault-tolerant capabilities of the system. Simulation results reveal that ERMBF significantly improves the schedulability over existing, comparable algorithms in literature. 展开更多
关键词 real-time periodic tasks FAULT-TOLERANCE primary/backup copy multiprocessor systems
下载PDF
Hybrid Task and Message Scheduling in Hard Real Time Distributed Systems over FlexRay Bus
2
作者 Houda Jaouani Rim Bouhouch +2 位作者 Amel Ben Ncira Salem Hasnaoui Khaled Jlassi 《Computer Technology and Application》 2013年第9期445-454,共10页
FlexRay is a vehicular communication protocol designed to meet growing requirements in hard real time automotive systems and to support time triggered as well as event triggered paradigms. Thus, there has been a lot o... FlexRay is a vehicular communication protocol designed to meet growing requirements in hard real time automotive systems and to support time triggered as well as event triggered paradigms. Thus, there has been a lot of recent interest in timing analysis techniques in order to provide bounds for the message communication times on FlexRay. In this paper, we present an approach to compute the WCRT (worst case response time) for periodic and sporadic tasks, within a FlexRay node, responsible for sending messages on the FlexRay SS (static segment) and DS (dynamic segment). On the other hand, we propose a scheduling table for messages transmitted over the FlexRay SS. An interesting innovation would be the use of a scheduling algorithm performed on a FlexRay node to guarantee the arrival of the right data on the right time and to ensure that every task meets its deadline. As application, we will use the extended SAE (society of automotive engineers) benchmark for the FlexRay network to identify the static and dynamic tasks, and calculate the response time, based on a hybrid scheduling model to further prove that the deadline of the SAE benchmark applications is insured. 展开更多
关键词 FLEXRAY fixed scheduling periodic tasks WCRT SAE benchmark.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部