Andrew Sokolov and Eugene Barkovsky.
The Mathematical Model and The Problem of Optimal Partitioning of Shared Memory for Work-Stealing Deques
// Lecture Notes in Computer Science. 13th International Conference on Parallel Computing Technologies, PaCT 2015. Vol. 9251. 2015. Pp. 102-106
Ключевые слова: Work-stealing, Deques, Data structures, Markov chains, Random walks
In this paper we propose the mathematical model and solve the problem of optimal partitioning of shared memory for work-stealing deques. Operations have probabilistic characterisation and along with sequential execution it is possible to execute operations on deques (with given probabilities) in parallel.
Индексируется в Web of Science, Scopus, РИНЦ
Последние изменения: 28 февраля 2018