The linked list representation of n LIFO-stacks and/or FIFO-queues in the single-level memory
From MaRDI portal
Publication:2445263
Recommendations
Cites work
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 3972180 (Why is no real title available?)
- scientific article; zbMATH DE number 1458587 (Why is no real title available?)
- An Analysis of a Memory Allocation Scheme for Implementing Stacks
- Random walks, heat equation and distributed algorithms
- Study of a non-Markovian stack management model in a two-level memory
Cited in
(5)- scientific article; zbMATH DE number 1839466 (Why is no real title available?)
- 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
- About optimal management of FIFO-queues in two-level memory
- Optimal parallel control of \(n\) FIFO-queues in shared memory
This page was built for publication: The linked list representation of \(n\) LIFO-stacks and/or FIFO-queues in the single-level memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445263)