scientific article; zbMATH DE number 903457

DOI10.1002/(SICI)1098-2418(199605)8:3%3C179::AID-RSA2%3E3.0.CO;2-VMaRDI QIDQ4885223zbMATH OpenFDO

Authors James Allen Fill, Lars Holst

Publication date 8 December 1996

Full work available at URL https://doi.org/10.1002/(SICI)1098-2418(199605)8:3%3C179::AID-RSA2%3E3.0.CO;2-V

zbMATH Keywords

Schur-concavitystationary distributionstochastic ordering

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Recommendations

• On the distribution of the search cost for the move-to-front rule with random weights
• Limiting search cost distribution for the move-to-front rule with random request probabilities
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule
• Limiting behavior of the search cost distribution for the move-to-front rule in the stable case
• MOVE-TO-FRONT RULE FOR ACCESSING SEVERAL RECORDS

Cited in

(26)

• Asymptotic analysis of dichotomous search with search and travel costs
• Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
• Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement
• Limiting search cost distribution for the move-to-front rule with random request probabilities
• A fluid limit for a cache algorithm with general request processes
• scientific article; zbMATH DE number 2127725 (Why is no real title available?)
• scientific article; zbMATH DE number 3888923 (Why is no real title available?)
• scientific article; zbMATH DE number 3856448 (Why is no real title available?)
• Comparison of self-organizing linear search rules
• The Move-to-Front Rule for Multiple Lists
• On the distribution of the search cost for the move-to-front rule with random weights
• ON A CONJECTURE OF FILL AND HOLST INVOLVING THE MOVE-TO-FRONT RULE AND CACHE FAULTS
• Functional central limit theorem for tagged particle dynamics in stochastic ranking process with space-time dependent intensities
• Cache miss estimation for non-stationary request processes
• Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
• A Transposition Rule Analysis Based on a Particle Process
• Stochastic ranking process with time dependent intensities
• Critical sizing of LRU caches with dependent requests
• Limiting behavior of the search cost distribution for the move-to-front rule in the stable case
• Enumerative theory for the Tsetlin library
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule
• Least-recently-used caching with dependent requests
• Near-Exact Computation of Independent Chip Model Placement Probabilities for Thousands of Players
• The limiting move-to-front search-cost in law of large numbers asymptotic regimes

This page was built for publication:

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