|
Title:
|
SOME CONSIDERATIONS ABOUT REAL TIME MULTIPROCESSOR OPERATING SYSTEMS |
|
Author(s):
|
Moshe Pelleh |
|
ISBN:
|
978-972-8924-62-1 |
|
Editors:
|
Hans Weghorn and Ajith P. Abraham |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Algorithm, Embedded system, Operating System, Multiprocessor, Real Time. |
|
Type:
|
Full Paper |
|
First Page:
|
51 |
|
Last Page:
|
58 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Most Real Time Operating Systems (RTOS) are designated to a single-processor system, when we are just extensively
developing multiprocessor systems. There is a variety of algorithms for scheduling tasks on a processor. The most
common scheduling algorithms are: RM, EDF and LST. They are optimal for a single processor scheduling, but at the
same time anomalies (deadline miss) occur when the algorithms are used for multiprocessor scheduling. We want to
develop an RTOS for multiprocessor systems, with scheduling algorithms that avoid anomalies, and with maximum
schedulable utilization. The maximum schedulable utilization is achieved for a system of periodic preemptable
independent tasks (without blocking time). |
|
|
|
|
|
|
