Abstract

The aim of this research is to construct and analyze the mathematical model of \(n\) parallel circular FIFO-queues, located in a shared memory. The mathematical model is built in the form of random walks on an integer lattice in \(n\)-dimensional space. Operations (with given probabilities) occur at each step of the discrete time.

中文翻译：

---

共享内存中$ n $$ FIFO队列的最佳并行控制

摘要

这项研究的目的是构建和分析位于共享内存中的\（n \）并行循环FIFO队列的数学模型。数学模型以\（n \）维空间中的整数晶格上的随机游动形式建立。操作（具有给定的概率）发生在离散时间的每个步骤中。