Optimal parallel control of n FIFO-queues in shared memory

DOI10.1134/S1995080221010066MaRDI QIDQ2656403zbMATH OpenOpenAlexFDO

Authors E. A. Aksenova, A. V. Sokolov

Publication date 11 March 2021

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1995080221010066

zbMATH Keywords

data structuresFIFO-queuesMarkov chainsmathematical modelingrandom walks

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• scientific article; zbMATH DE number 2039071
• Modeling of priorityless processing in an interleaved memory with a perfectly informed processor
• scientific article; zbMATH DE number 1839466
• scientific article; zbMATH DE number 4204095
• OPTIMAL CONTROL OF PARALLEL QUEUES WITH BATCH SERVICE

Cites work

• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 1458587 (Why is no real title available?)
• Optimal management of two parallel stacks in two-level memory
• Study of a non-Markovian stack management model in a two-level memory
• The linked list representation of \(n\) LIFO-stacks and/or FIFO-queues in the single-level memory
• The models and methods of optimal control of three work-stealing deques located in a shared memory

Cited in

(5)

• About optimal management of work-stealing deques in two-level memory
• The models and methods of optimal control of three work-stealing deques located in a shared memory
• The linked list representation of \(n\) LIFO-stacks and/or FIFO-queues in the single-level memory
• About optimal management of FIFO-queues in two-level memory
• scientific article; zbMATH DE number 1839466 (Why is no real title available?)

This page was built for publication: Optimal parallel control of \(n\) FIFO-queues in shared memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656403)