IMPLICATIONS ON SUITABLE MULTIPROCESSOR STRUCTURES AND VIRTUAL STORAGE MANAGEMENT WHEN APPLYING A FEASIBLE SCHEDULING ALGORITHM IN HARD REAL-TIME ENVIRONMENTS.

Multiprocessor structures yielding the best performance in hard real-time applications when taking the objectives of feasible processor scheduling, inherent deadlock prevention, minimization of context-switching operations, and guaranteed reaction times as a basis are investigated. The considerations reveal that single processor systems in co-operation with devices specialized in carrying through operating system nuclei have advantages over classical von Neumann and symmetrical multiprocessor structures. Furthermore, it is shown that nearly optimal look-ahead algorithms for the virtual storage administation employing the code of entire tasks as paging elements are closely related to the deadline-driven scheduling.