Recent papers have proposed to design scheduling algorithms entirely as discrete-time controllers, i.e., to refrain from preserving the already installed scheduler, and replace it completely. At the cost of some system re-design impact, this new approach has been proved to yield significant advantages in terms of code size and simplicity, and above all to open the way to a system-theoretical analysis, thereby permitting to prove relevant properties in a rigorous manner. This manuscript presents some refinements and improvements of an already conceived control structure, allowing for more flexible task management and better comprehension on the part of the system administrator. A standard benchmark is used to support the necessary performance analysis.
Performance analysis of operating systems schedulers realised as discrete-time controllers
LEVA, ALBERTO;MAGGIO, MARTINA;TERRANEO, FEDERICO
2012-01-01
Abstract
Recent papers have proposed to design scheduling algorithms entirely as discrete-time controllers, i.e., to refrain from preserving the already installed scheduler, and replace it completely. At the cost of some system re-design impact, this new approach has been proved to yield significant advantages in terms of code size and simplicity, and above all to open the way to a system-theoretical analysis, thereby permitting to prove relevant properties in a rigorous manner. This manuscript presents some refinements and improvements of an already conceived control structure, allowing for more flexible task management and better comprehension on the part of the system administrator. A standard benchmark is used to support the necessary performance analysis.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
