The linked list representation of n LIFO-stacks and/or FIFO-queues in the single-level memory

DOI10.1016/J.IPL.2013.07.021zbMATH Open1284.68219OpenAlexW2094974991MaRDI QIDQ2445263FDOQ2445263

Authors: A. V. Sokolov, A. V. Drac 

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.07.021

Recommendations

• scientific article; zbMATH DE number 1839466
• Optimal parallel control of \(n\) FIFO-queues in shared memory
• scientific article; zbMATH DE number 3972180
• scientific article; zbMATH DE number 3988713
• Study of a non-Markovian stack management model in a two-level memory

zbMATH Keywords

data structuresmathematical modelingdynamic data structureslinked listsFIFO-stacksLIFO-queues

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Sums of independent random variables; random walks (60G50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Study of a non-Markovian stack management model in a two-level memory
• Random walks, heat equation and distributed algorithms
• Title not available (Why is that?)
• An Analysis of a Memory Allocation Scheme for Implementing Stacks
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• 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)