Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




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

Avtomatika i Telemekhanika, 2017, Issue 3, Pages 34–50 (Mi at14730)  
This article is cited in 2 scientific papers (total in 2 papers)

Stochastic Systems, Queuing Systems

Local search for load balancing problems for servers with large dimension

I. A. Davydovab, A. A. Melnikovab, P. A. Kononovaab

a Novosibirsk State University, Novosibirsk, Russia
b Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
Full-text PDF (679 kB) Citations (2)
References:
PDF
HTML
Abstract: We consider a new load balancing model that arises in the processing of user requests for files located on a given set of servers. The optimization criterion is the total excess of actual load over the limit load. In order to redistribute the load and minimize the criterion, files can be moved between the servers. We show that if there are no other constraints related to the stage of moving the files, then this problem is equivalent to a problem previously considered in literature. For this special case of this problem, we propose a stochastic local search scheme that combines a special procedure for fast querying of the neighborhoods and a procedure of non-aggravating modification of intermediate solutions. Results of numerical experiments show that the proposed approach is able to find high-quality solutions for instances of large dimension under tight time constraints.
Keywords: stochastic local search, randomized neighborhood, combinatorial optimization, packing problems.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 02.G25.31.0054
This study was performed at the Novosibirsk State University with financial support of the Russian Ministry of Science and Education, project no. 02.G25.31.0054.
Presented by the member of Editorial Board: A. I. Kibzun

Received: 11.06.2015
English version:
Automation and Remote Control, 2017, Volume 78, Issue 3, Pages 412–424
DOI: https://doi.org/10.1134/S0005117917030031
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: I. A. Davydov, A. A. Melnikov, P. A. Kononova, “Local search for load balancing problems for servers with large dimension”, Avtomat. i Telemekh., 2017, no. 3, 34–50; Autom. Remote Control, 78:3 (2017), 412–424
Citation in format AMSBIB
\Bibitem{DavMelKon17}
\by I.~A.~Davydov, A.~A.~Melnikov, P.~A.~Kononova
\paper Local search for load balancing problems for servers with large dimension
\jour Avtomat. i Telemekh.
\yr 2017
\issue 3
\pages 34--50
\mathnet{http://mi.mathnet.ru/at14730}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3666084}
\elib{https://elibrary.ru/item.asp?id=28960577}
\transl
\jour Autom. Remote Control
\yr 2017
\vol 78
\issue 3
\pages 412--424
\crossref{https://doi.org/10.1134/S0005117917030031}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000396338200003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85014951422}
Linking options:
  • https://www.mathnet.ru/eng/at14730
  • https://www.mathnet.ru/eng/at/y2017/i3/p34
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:227
    Full-text PDF :51
    References:35
    First page:11
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024