Self-organizing files with dependent accesses

DOI10.2307/3213645zbMATH Open0535.68015OpenAlexW2331422813MaRDI QIDQ3319769FDOQ3319769

Authors:

Publication date: 1984

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213645

Recommendations

• scientific article; zbMATH DE number 2102775
• Comparison of self-organizing linear search rules
• scientific article; zbMATH DE number 795110
• The move-to-root rule for self-organizing trees with Markov dependent requests^∗
• Performance of the move-to-front algorithm with Markov-modulated request sequences

zbMATH Keywords

linear searchmove-to-front ruletransposition ruleself-organization filing techniques

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)

Cited In (12)

• A Transposition Rule Analysis Based on a Particle Process
• A fluid limit for a cache algorithm with general request processes
• Self-organizing sequential search and Hilbert's inequalities
• Stochastic rearrangement rules for self-organizing data structures
• An exact formula for the move-to-front rule for self-organizing lists
• Multiplicities of eigenvalues of some linear search schemes
• Performance of the move-to-front algorithm with Markov-modulated request sequences
• Comparison of self-organizing linear search rules
• The move-to-root rule for self-organizing trees with Markov dependent requests^∗
• Title not available (Why is that?)
• Markov incremental constructions
• Data structures on event graphs

This page was built for publication: Self-organizing files with dependent accesses

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