Improving routing decisions in parallel non-observable queues

Konovalov, Mikhail; Razumchik, Rostislav

doi:10.1007/s00607-018-0598-5

Cited by 6 publications

(6 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And since all the quantities in (4) remain properly defined for both batch-wise and job-wise routing, we choose (4) as the basic deterministic dispatching policy. The third class of routing policies further referred to as AA (Arrival-Aware) is based on the following intuitive idea (see Konovalov and Razumchik (2018)): longer inter-arrival times increase the probability of those system's states, which correspond to lower workloads in 8 One of the well-known examples of such a policy is the Round-Robin policy. It rotates the jobs between the queues in the cyclic order and thus is applicable only in the systems with homogeneous servers (i.e.…”

Section: Finite -Discrete -Element Simulationmentioning

confidence: 99%

“…Numerical examples in the next section give some impression on how these dispatching policies are ranked, 12 We conjecture that the algorithm of Konovalov and Razumchik (2018) can be adopted to the considered system at least in the case when the dispatcher operates in the batch-wise mode, i.e. assigns the whole batch to the same server.…”

Section: Finite -Discrete -Element Simulationmentioning

confidence: 99%

“…But, due to the absence of any online information, from the long list of routing rules, only the following two naive (in terminology of (Mengistu and Che, 2019, Section 2.3)) policies are feasible: probabilistic and deterministic. According to the numerical experiments (see Konovalov and Razumchik (2020)), both these rules can be outperformed by the algorithm, which implements the socalled arrival-aware policy (see Konovalov and Razumchik (2018)) for single-arrival non-observable systems. In this paper numerical evidence is given that all the three policies (probabilistic, deterministic and arrival-aware) can be applied by the dispatcher in a batch-arrival system.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

ECMS 2021 Proceedings edited by Khalid Al-Begain, Mauro Iacono, Lelio Campanile, Andrzej Bargiela

2021

View full text Add to dashboard Cite

This research paper discusses the application of multiagent simulation model of production processes by reference to milk receiving and storage. The paper describes basic parameters for general models, and presents the experiment results obtained during the model processing, as well as the approach towards implementation of the multiagent system employing AnyLogic simulation environment. The introduction of general technique to plot multiagent simulation models allows to use digital tools to create a virtual copy of the true-life processes with the possibility to provide forecast and identification of the food production industries. The employment of simulation modeling enables refinement of the production process under study, identification of its weaknesses, and provision of the expert opinion on improvement of production processes and as regards the results of virtual testing thereof.

show abstract

Section: Finite -Discrete -Element Simulationmentioning

confidence: 99%

Section: Finite -Discrete -Element Simulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

ECMS 2021 Proceedings edited by Khalid Al-Begain, Mauro Iacono, Lelio Campanile, Andrzej Bargiela

2021

View full text Add to dashboard Cite

show abstract

“…The second class of policies, which can be used in the given context, is the modification of the policy proposed in Konovalov and Razumchik (2018) for the minimization of the job's mean response time in non-observable queues with FIFO scheduling 11 . The dispatching rule is the following: send the first job to the queue with the fastest server; send the n-th job to the queue y n , where…”

Section: Overview Of the New Policiesmentioning

confidence: 99%

“…Then, if initially the system is empty, the distribution p (m) n of the number of jobs in the queue m upon arrival of the n th , n ≥ 1, job can be computed recursively from the relations: 11 The following observation is forth noticing here. While there is no rational reason to use the arrival-aware (AA) policy, proposed in Konovalov and Razumchik (2018), in a PS server farm (when trying to minimize the mean response time or mean waiting time), it becomes reasonable as soon as the system's load is high and in the queues, instead of PS, the limited processor sharing policy (LPS) with the same/different multi-programming levels (MPL) is used. The intuition behind this idea is the following.…”

Section: Overview Of the New Policiesmentioning

confidence: 99%

ECMS 2019 Proceedings edited by Mauro Iacono, Francesco Palmieri, Marco Gribaudo, Massimo Ficco

2019

View full text Add to dashboard Cite

The 33rd edition of the ECMS conference, a widely consolidated interdisciplinary forum for simulation and modeling researchers and practitioners that keeps its reference position year after year, brings with it two novelties: a new name and a new form of publication. In fact, to better catch in the name the actual situation of participants, the European Council for Modelling and Simulation decided to rename the event as "ECMS International Conference on Modelling and Simulation". This year, we also start a new book series of annual volumes, namely "Communications of the ECMS", which replaces the name "Proceedings" in order to acknowledge the recognition and reputation of the scientific community of simulation. This year the chosen conference venue is in Caserta, Italy. The Università degli Studi della Campania "Luigi Vanvitelli", previously known as Seconda Università degli Studi di Napoli, a state-owned university founded in 1990 with the explicit mission of meeting the cultural demand of the population living in the northern part of Campania. Caserta, famous for its wonderful royal palace, whose facilities will host the conference, is a city with a long history, already inhabited in the 5th century BC. It flourished in the middle age and then in the XVI-XVII century AD, surrounded by a geographical area rich of historical relevance that was under Roman influence.The university is characterized by its diffusion over the territory of the province of Caserta, having its 16 departments located in Caserta, Aversa and Santa Maria Capua Vetere, and Napoli, in which its roots can be found: the most of the departments are located in historical landmarks, that have been saved and recovered by specific agreements and funding. More than 25000 students from Italy and abroad study at Vanvitelli University enrolled in bachelor, master and PhD. curricula, taught as well in Italian as in English, and covering different aspects of mathematics, physics, data analytics, engineering, law, economics, political sciences, medicine, nursery, biotechnology, pharmacy, environmental sciences, cultural heritage, literature, psychology, tourism, design and architecture.We are honored to offer, besides the scientific program of the conference, consisting in more than 65 high quality accepted papers, a rich and various series of social events, as usual for the spirit of this conference.

show abstract

Minimizing Mean Response Time in Nonobservable Distributed Processing Systems with Nodes Operating under Egalitarian Processor-Sharing Policy

Konovalov

Razumchik

2020

J. Commun. Technol. Electron.

View full text Add to dashboard Cite

Improving routing decisions in parallel non-observable queues

Cited by 6 publications

References 31 publications

ECMS 2021 Proceedings edited by Khalid Al-Begain, Mauro Iacono, Lelio Campanile, Andrzej Bargiela

ECMS 2021 Proceedings edited by Khalid Al-Begain, Mauro Iacono, Lelio Campanile, Andrzej Bargiela

ECMS 2019 Proceedings edited by Mauro Iacono, Francesco Palmieri, Marco Gribaudo, Massimo Ficco

Minimizing Mean Response Time in Nonobservable Distributed Processing Systems with Nodes Operating under Egalitarian Processor-Sharing Policy

Contact Info

Product

Resources

About