Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Diskretnyi Analiz i Issledovanie Operatsii, 2016, Volume 23, Issue 4, Pages 5–25
DOI: https://doi.org/10.17377/daio.2016.23.525 (Mi da856) 		 
This article is cited in 1 scientific paper (total in 1 paper)

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
Full-text PDF (326 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2016.23.525
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
Received: 04.02.2016
Revised: 24.06.2016
English version:
Journal of Applied and Industrial Mathematics, 2016, Volume 10, Issue 4, Pages 494–504
DOI: https://doi.org/10.1134/S1990478916040050
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
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://mathscinet.ams.org/mathscinet-getitem?mr=3581883}
\elib{https://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{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84996565548}
Linking options:
  • https://www.mathnet.ru/eng/da856
  • https://www.mathnet.ru/eng/da/v23/i4/p5
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:181
    Full-text PDF :57
    References:27
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024