Email this article On minimizing dataset transfer time in an acyclic network with four servers
- Authors: Kononov A.V.1,2, Kononova P.A.1,2
-
Affiliations:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Issue: Vol 10, No 4 (2016)
- Pages: 494-504
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/212506
- DOI: https://doi.org/10.1134/S1990478916040050
- ID: 212506
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
A. V. Kononov
Sobolev Institute of Mathematics; Novosibirsk State University
Author for correspondence.
Email: alvenko@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
P. A. Kononova
Sobolev Institute of Mathematics; Novosibirsk State University
Email: alvenko@math.nsc.ru
Russian Federation, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090
Supplementary files
