Localization of real-time systems computational resources
Informacionnye tehnologii i vyčislitelnye sistemy, no. 2 (2011), pp. 23-40
Voir la notice de l'article provenant de la source Math-Net.Ru
Real-time systems with a finite (may be big) number of tasks are under consideration. A system is called resolvable if there exists a planning providing in time completion of each task.
The paper deals with the localization problem: on what conditions thef in time completion problem of a system could be reduced to existence of a number of independent and local in time resolvable subsystems. Full subsystem is defined as a natural local planning object. It is proved that a system is uniquely represented as a union of a number of full subsystems and that a system is resolvable in case all full subsystems are resolvable.
Keywords:
real time systems, software, multitasking, planning, localization, full subsystem, resolvable systems.
@article{ITVS_2011_2_a2,
author = {A. I. Gryuntal},
title = {Localization of real-time systems computational resources},
journal = {Informacionnye tehnologii i vy\v{c}islitelnye sistemy},
pages = {23--40},
publisher = {mathdoc},
number = {2},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ITVS_2011_2_a2/}
}
A. I. Gryuntal. Localization of real-time systems computational resources. Informacionnye tehnologii i vyčislitelnye sistemy, no. 2 (2011), pp. 23-40. http://geodesic.mathdoc.fr/item/ITVS_2011_2_a2/