Informatika i Ee Primeneniya [Informatics and its Applications]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Inform. Primen.:
Year:
Volume:
Issue:
Page:
Find






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


Informatika i Ee Primeneniya [Informatics and its Applications], 2015, Volume 9, Issue 4, Pages 56–67
DOI: https://doi.org/10.14357/19922264150406
(Mi ia392)
 

This article is cited in 5 scientific papers (total in 5 papers)

Methods and algorithms for job scheduling in systems with parallel service: a survey

M. G. Konovalov, R. V. Razumchik

Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
Full-text PDF (236 kB) Citations (5)
References:
Abstract: The review of research papers devoted to the analysis of the dispatching problem in queueing systems is presented. The analysis is restricted to the class of systems with independent, operating in parallel, fully reliable servers, stochastic incoming flows of customers without any preceding constraints. The general goal of the analysis carried out in most of the papers is the solution of an optimization problem, which specification heavily depends on additional assumptions made. The models considered in the review are classified into several classes depending on the amount of a priori information and observability at decision times and performance criteria. The description of the dispatching algorithms most commonly found in literature and their properties is given. The main methods used for the analysis of the systems under these dispatching algorithms are reviewed. This review is intended to draw attention of the research community to one of the important problems in the field of information processing.
Keywords: dispatching; scheduling; parallel service; queueing system; optimization.
Funding agency Grant number
Russian Foundation for Basic Research 15-07-03406
13-07-00223
The research was partly supported by the Russian Foundation for Basic Research (projects 15-07-03406 and 13-07-00223).
Received: 19.10.2015
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: M. G. Konovalov, R. V. Razumchik, “Methods and algorithms for job scheduling in systems with parallel service: a survey”, Inform. Primen., 9:4 (2015), 56–67
Citation in format AMSBIB
\Bibitem{KonRaz15}
\by M.~G.~Konovalov, R.~V.~Razumchik
\paper Methods and algorithms for job scheduling in systems with parallel service: a survey
\jour Inform. Primen.
\yr 2015
\vol 9
\issue 4
\pages 56--67
\mathnet{http://mi.mathnet.ru/ia392}
\crossref{https://doi.org/10.14357/19922264150406}
\elib{https://elibrary.ru/item.asp?id=25133769}
Linking options:
  • https://www.mathnet.ru/eng/ia392
  • https://www.mathnet.ru/eng/ia/v9/i4/p56
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Информатика и её применения
    Statistics & downloads:
    Abstract page:327
    Full-text PDF :145
    References:67
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024