The Self-organizing List and Processor Problems under Randomized Policies

  T. Makjamroen

Abstract:

  We consider the self-organizing list problem in the case that only one item has a different request probability and show that transposition has a steady state cost stochastically smaller than any randomized policy that moves the requested item, found in position , to position with some probability . A random variable is said to be stochastically smaller than another random variable , written if , for any . This is a stronger statement than . We also show that the steady state cost under the policy that moves the requested item positions forward is stochastically increasing in . Sufficient conditions are given for the steady state cost under a randomized policy to be stochastically smaller than that under another randomized policy . Similar results are obtained for the processor problem, where a list of processors is considered.

 Gyenizse Pal 1996. Szeptember 4. Szerda 13:51:06 MET DST