Self-organizing files with dependent accesses

DOI10.2307/3213645zbMath0535.68015OpenAlexW2331422813MaRDI QIDQ3319769

No author found.

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

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)

Related Items (9)

A Transposition Rule Analysis Based on a Particle Process ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ Stochastic rearrangement rules for self-organizing data structures ⋮ Performance of the move-to-front algorithm with Markov-modulated request sequences ⋮ The move-to-root rule for self-organizing trees with Markov dependent requests^∗ ⋮ Markov incremental constructions ⋮ A fluid limit for a cache algorithm with general request processes ⋮ Multiplicities of eigenvalues of some linear search schemes ⋮ Data structures on event graphs

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