RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2016, Volume 23, Number 4, Pages 5–25 (Mi da856)  

On minimizing dataset transfer time in an acyclic network with four servers

A. V. Kononovab, P. A. Kononovaab

a Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia

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. Ill. 17, bibliogr. 14.

Keywords: multiprocessor scheduling, polynomial time algorithm, NP-hardness.

Funding Agency Grant Number
Russian Science Foundation 15-11-10009


DOI: https://doi.org/10.17377/daio.2016.23.525

Full text: PDF file (326 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2016, 10:4, 494–504

Bibliographic databases:

UDC: 519.8
Received: 04.02.2016
Revised: 24.06.2016

Citation: A. V. Kononov, P. A. Kononova, “On minimizing dataset transfer time in an acyclic network with four servers”, Diskretn. Anal. Issled. Oper., 23:4 (2016), 5–25; J. Appl. Industr. Math., 10:4 (2016), 494–504

Citation in format AMSBIB
\Bibitem{KonKon16}
\by A.~V.~Kononov, P.~A.~Kononova
\paper On minimizing dataset transfer time in an acyclic network with four servers
\jour Diskretn. Anal. Issled. Oper.
\yr 2016
\vol 23
\issue 4
\pages 5--25
\mathnet{http://mi.mathnet.ru/da856}
\crossref{https://doi.org/10.17377/daio.2016.23.525}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3581883}
\elib{http://elibrary.ru/item.asp?id=27349041}
\transl
\jour J. Appl. Industr. Math.
\yr 2016
\vol 10
\issue 4
\pages 494--504
\crossref{https://doi.org/10.1134/S1990478916040050}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84996565548}


Linking options:
  • http://mi.mathnet.ru/eng/da856
  • http://mi.mathnet.ru/eng/da/v23/i4/p5

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:103
    Full text:37
    References:17
    First page:5

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020