Premium
Implications on Suitable Multiprocessor Structures and Virtual Storage Management when Applying a Feasible Scheduling Algorithm in Hard Real‐Time Environments
Author(s) -
Halang Wolfgang A.
Publication year - 1986
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/j.1097-024x.1986.tb00007.x
Subject(s) - multiprocessing , computer science , context switch , scheduling (production processes) , computer multitasking , paging , parallel computing , multiprocessor scheduling , minification , distributed computing , deadlock , algorithm , fair share scheduling , two level scheduling , embedded system , operating system , mathematical optimization , schedule , mathematics , programming language
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 administration employing the code of entire tasks as paging elements are closely related to the deadline‐driven scheduling.