Optimal parallel control of n FIFO-queues in shared memory
From MaRDI portal
Publication:2656403
Recommendations
- scientific article; zbMATH DE number 2039071
- Modeling of priorityless processing in an interleaved memory with a perfectly informed processor
- Mathematical models and optimal algorithms of dynamic data structure control
- 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?)
- Optimal management of two parallel stacks in two-level memory
- Study of a non-Markovian stack management model in a two-level memory
- The art of computer programming. Vol. 2, Chapter 4
- 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
- Mathematical models and optimal algorithms of dynamic data structure control
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)