Planning of tasks with аsynchronous start
Informacionnye tehnologii i vyčislitelnye sistemy, no. 1 (2012), pp. 32-51
Cet article a éte moissonné depuis la source Math-Net.Ru
Real-time systems with a finite quantity of tasks with arbitrary moments of start are under consideration. A system is called resolvable if there exists a planning providing in time completion of each task. Planning is monotonous if at any moment a performing task is a task with minimum time resource. The main result states that for each resolvable system there exists a resolving monotonous planning.
Keywords:
real time systems, software, multitasking, monotonous planning, resolvable systems, аsynchronous start.
@article{ITVS_2012_1_a2,
author = {A. I. Gryuntal},
title = {Planning of tasks with {\cyra}synchronous start},
journal = {Informacionnye tehnologii i vy\v{c}islitelnye sistemy},
pages = {32--51},
year = {2012},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ITVS_2012_1_a2/}
}
A. I. Gryuntal. Planning of tasks with аsynchronous start. Informacionnye tehnologii i vyčislitelnye sistemy, no. 1 (2012), pp. 32-51. http://geodesic.mathdoc.fr/item/ITVS_2012_1_a2/