Virtual Machine Dispatching under Fairness Constraints

Autor:	Herbert Eberle, K. F. Finkemeyer, Hermann Schmutz
Rok vydání:	1979
Předmět:	Virtual finite-state machine Low overhead Virtual machine Computer science Real-time computing Sorting Temporal isolation among virtual machines Preemption Parallel computing Predictability computer.software_genre computer
Zdroj:	Virtuelle Maschinen ISBN: 9783540096184 Virtuelle Maschinen
DOI:	10.1007/978-3-642-67415-0_6
Popis:	The paper analyzes the problems of low level dispatching under predictability constraints, with good responsiveness and low overhead. It is shown that nonpreemptive and/or round-robin disciplines fail for the general case. A novel algorithm is proposed based on sorting at time slice intervals. Simulation results are used to discuss the properties of the new dispatching algorithm.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::49d1d4fb1c603b940d8b2fa4654c6389 https://doi.org/10.1007/978-3-642-67415-0_6 Zobrazit plný text záznamu