The self-organizing list and processor problems under randomized policies

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 t, to position j with some probabilit...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Makjamroen T.
Dokumentumtípus: Cikk
Megjelent: 1992
Sorozat:Acta cybernetica 10 No. 4
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12513
Leíró adatok
Tartalmi kivonat: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 t, to position j with some probability dij, i > j. A random variable X is said to be stochastically smaller than another random variable Y, written X <„ Y if Pr{X > Jfc} < Pr{Y > k}, for any k. This is a stronger statement than E[X] < E[Y|. We also show that the steady state cost under the policy that moves the requested item i positions forward is stochastically increasing in t. Sufficient conditions are given for the steady state cost under a randomized policy A to be stochastically smaller than that under another randomized policy B. Similar results are obtained for the processor problem, where a list of processors is considered.
Terjedelem/Fizikai jellemzők:283-302
ISSN:0324-721X