Scientific publications

The paper analyzes the problem of optimal control of a work-stealingdeque in two-level memory (for example, registers –random access memory),where probabilities of parallel operations with the deque are known. The classicsequential cyclic method for representing a deque in memory is considered. If adeque overflows or empty, we transfer elements from its middle part from the fastmemory to the slow memory, since data from the end parts of the deque may beneeded earlier. The problem is to find the optimal number of elements from bothsides of the deque to leave in the fast memory if the deque is full or empty.As an optimality criterion, we consider the minimum average cost of memoryreallocation, which is necessary in case of overflow or emptying of fast memory.The simulation model of this process is constructed. The results of numericalexperiments are presented