More on weighted servers or FIFO is better than LRU. (Q1426456): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Leah Epstein / rank
Normal rank
 
Property / author
 
Property / author: Leah Epstein / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited bookmark randomized online algorithms for the paging problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trackless online algorithms for the server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: LRU is better than FIFO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Algorithms for Relaxed List Update and Multilevel Caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for the weighted server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line file caching / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:54, 6 June 2024

scientific article
Language Label Description Also known as
English
More on weighted servers or FIFO is better than LRU.
scientific article

    Statements

    More on weighted servers or FIFO is better than LRU. (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    \(k\)-Server problem
    0 references
    Weights
    0 references
    Trackless algorithms
    0 references