Geodesic
On minimizing dataset transfer time in an acyclic network with four servers
Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 4, pp. 5-25

Voir la notice de l'article provenant de la source Math-Net.Ru

Under consideration is some optimization problem of data transmission in a hierarchical acyclic network. This problem is a special case of the makespan minimization problem with multiprocessor jobs on dedicated machines.We study computational complexity of the subproblems with a specific set of job types, where the type of a job is a subset of the machines required by the job. Ill. 17, bibliogr. 14.
Keywords: multiprocessor scheduling, NP-hardness.
Mots-clés : polynomial time algorithm 
@article{DA_2016_23_4_a0,
     author = {A. V. Kononov and P. A. Kononova},
     title = {On minimizing dataset transfer time in an acyclic network with four servers},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {5--25},
     publisher = {mathdoc},
     volume = {23},
     number = {4},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2016_23_4_a0/}
}
TY  - JOUR
AU  - A. V. Kononov
AU  - P. A. Kononova
TI  - On minimizing dataset transfer time in an acyclic network with four servers
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2016
SP  - 5
EP  - 25
VL  - 23
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2016_23_4_a0/
LA  - ru
ID  - DA_2016_23_4_a0
ER  - 
%0 Journal Article
%A A. V. Kononov
%A P. A. Kononova
%T On minimizing dataset transfer time in an acyclic network with four servers
%J Diskretnyj analiz i issledovanie operacij
%D 2016
%P 5-25
%V 23
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2016_23_4_a0/
%G ru
%F DA_2016_23_4_a0
A. V. Kononov; P. A. Kononova. On minimizing dataset transfer time in an acyclic network with four servers. Diskretnyj analiz i issledovanie operacij, Tome 23 (2016) no. 4, pp. 5-25. http://geodesic.mathdoc.fr/item/DA_2016_23_4_a0/