Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-06-04T03:18:42.350Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  01 July 1999

Martin Hildebrand
Martin Hildebrand
Affiliation:
Department of Mathematics and Statistics, State University of New York, University at Albany, Albany, NY 12222, martinhi@math.albany.edu
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 13 , Issue 3 , July 1999 , pp. 377 - 385
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)