Skip to main content Accessibility help
×
Home

ON A CONJECTURE OF FILL AND HOLST INVOLVING THE MOVE-TO-FRONT RULE AND CACHE FAULTS

  • Martin Hildebrand (a1)

Abstract

Fill and Holst conjectured for the move-to-front rule that the probability that the search time is greater than c will be Schur concave in the stationary distribution for any value of c. This paper disproves the conjecture but proves some conclusions that would be implied by the conjecture.

Copyright

Related content

Powered by UNSILO

ON A CONJECTURE OF FILL AND HOLST INVOLVING THE MOVE-TO-FRONT RULE AND CACHE FAULTS

  • Martin Hildebrand (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.