Scheduling Algorithm in Distributed Real-Time Systems
Rui Tao
Abstract
Rui Tao
Abstract
As a kind of real-time systems, distributed real-time system has been used widely and attracted much attentions. There are many schemes on distributed real-time systems task scheduling. The article has carried on the synthetic evaluation in some scheduling algorithms, such as static scheduling algorithms, dynamic scheduling algorithms, predicting scheduling algorithms, fault -tolerant scheduling algorithms and reflex dynamic scheduling algorithms.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
As a kind of real-time systems, distributed real-time system has been used widely and attracted much attentions. There are many schemes on distributed real-time systems task scheduling. The article has carried on the synthetic evaluation in some scheduling algorithms, such as static scheduling algorithms, dynamic scheduling algorithms, predicting scheduling algorithms, fault -tolerant scheduling algorithms and reflex dynamic scheduling algorithms.
Key concepts: Dynamic priority scheduling, Fair-share scheduling, Rate-monotonic scheduling, Computer science, Earliest deadline first scheduling, Two-level scheduling, Round-robin scheduling, Fixed-priority pre-emptive scheduling