Planning of tasks with аsynchronous start
Informacionnye tehnologii i vyčislitelnye sistemy, no. 1 (2012), pp. 32-51.

Voir la notice de l'article provenant de 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},
     publisher = {mathdoc},
     number = {1},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ITVS_2012_1_a2/}
}
TY  - JOUR
AU  - A. I. Gryuntal
TI  - Planning of tasks with аsynchronous start
JO  - Informacionnye tehnologii i vyčislitelnye sistemy
PY  - 2012
SP  - 32
EP  - 51
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ITVS_2012_1_a2/
LA  - ru
ID  - ITVS_2012_1_a2
ER  - 
%0 Journal Article
%A A. I. Gryuntal
%T Planning of tasks with аsynchronous start
%J Informacionnye tehnologii i vyčislitelnye sistemy
%D 2012
%P 32-51
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ITVS_2012_1_a2/
%G ru
%F 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/