2. Main scheduling algorithms
Simply adding an extra processor to the platform drastically increases the complexity of real-time scheduling problems. As early as 1969, C.L. Liu observed that very few results known in single-processor environments could be directly generalized to multiprocessor systems. . The first optimal algorithm, i.e. to schedule task systems with total utilization equal to platform capacity, was not proposed until 1993.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Main scheduling algorithms
Article included in this offer
"Software technologies and System architectures"
(
230 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
