Least-recently-used caching with dependent requests (Q703555): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2004.07.029 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964774074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics That Dynamically Organize Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a model for storage and search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of the move-to-front algorithm with Markov-modulated request sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact formula for the move-to-front rule for self-organizing lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits and rates of convergence for the distribution of search cost under the move-to-front rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birthday paradox, coupon collectors, caching algorithms and self- organizing search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Competitive Algorithms for Paging with Locality of Reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential asymptotics of a Markov-modulated random walk with queueing applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic loss probability in a finite buffer fluid queue with heterogeneous heavy-tailed on-off processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Serial Files with Relocatable Records / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large deviations of sums of independent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the transition probabilities of the move-to-front scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-organizing sequential search heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The performance of the move-to-front scheme under some particular forms of Markov requests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865050 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2004.07.029 / rank
 
Normal rank

Latest revision as of 01:10, 10 December 2024

scientific article
Language Label Description Also known as
English
Least-recently-used caching with dependent requests
scientific article

    Statements

    Least-recently-used caching with dependent requests (English)
    0 references
    0 references
    0 references
    11 January 2005
    0 references
    Move-to-front
    0 references
    Zipf's law
    0 references
    Heavy-tailed distributions
    0 references
    Long-range dependence
    0 references
    Semi-Markov processes
    0 references
    Average-case analysis
    0 references

    Identifiers