Transactions of KarRC RAS :: Scientific publications
Transactions of KarRC RAS :: Scientific publications

Transactions of KarRC RAS :: Scientific publications
Karelian Research Centre of RAS
ISSN (print): 1997-3217
ISSN (online): 2312-4504
Transactions of KarRC RAS :: Scientific publications
Background Editorial committee Editorial Office Statute For authors For reviewer Russian version
Transactions of KarRC RAS :: Scientific publications

Electronic Journal OJS



Series

Biogeography

Experimental biology

Mathematical modeling and information technologies

Precambrian Geology

Ecological Studies Series

Limnology and oceanology

Research in the humanities (2010-2015)

Region: Economy and Management (2012-2015)



Issues

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

1999-2008


SCIENTIFIC PUBLICATIONS
Н.В. Каблукова, А.В. Соколов.
Математический анализ одного способа представления двух FIFO-очередей в общей памяти
// Труды КарНЦ РАН. No 1. Сер. Математическое моделирование и информационные технологии. Вып. 4. 2013. C. 46-54
N.V. Kablukova, A.V. Sokolov. Mathematical analysis of a way of presenting two FIFO queues in shared memory // Transactions of Karelian Research Centre of Russian Academy of Science. No 1. Mathematical Modeling and Information Technologies. Vol. 4. 2013. Pp. 46-54
Keywords: FIFO queue, casual walk, regular Markov chains
Many applications need to work with several FIFO queues located in a common memory space. Various software or hardware solutions are used to this end [4, 7, 8]. In [8] the problem was formulated for building a mathematical model of the process of working with several FIFO queues in shared memory, where insertion of an item in the queue is allowed on an odd step of the discrete time, and deletion operations – onanevenstep.Theprobabilitiesoftheoperationsareknown.In[5]amathematical model of this process for the number of queues n =2 was proposed, and the problem of optimal partitioning of the shared memory between the two FIFO queues in the case of successive cyclic representation was dealt with. In this paper we construct a mathematical and a simulation models of the process of working with two queues, when they move around a circle, one after another [9].
Indexed at RSCI

trudy_2013_1_046-54.pdf (641 Kb, total downloads: 146)



  Last modified: May 19, 2016