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.
The Ultimate Scientific and Technical Reference
This article is included in
Software technologies and System architectures
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Main scheduling algorithms
Bibliography
The Ultimate Scientific and Technical Reference
