Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-28T17:18:44.792Z Has data issue: false hasContentIssue false
  • English
  • Français

Processor Reordering Rules

Published online by Cambridge University Press:  27 July 2009

Shledon M. Ross
Shledon M. Ross
Affiliation:
Department of Industrial Engineering and Operations ResearchUniversity of California, Berkeley Berkeley, California 94720
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a problem in which jobs continually arrive to a set of n processors that are arranged in an ordered list. When a job arrives the first processor in line attempts to process it; if it is unsuccessful then the next in line attempts it, and so on. Each time that processor j attempts to process a job it is, independently of all else, successful with (an unknown) probability pj. After a job has been completed or all n attempts have failed then, based on the result, we can reorder the processors before the next job arrives, with the objective being to minimize the average number of attempts per job. This paper compares the transposition rule and the move to the front rule.

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 4 , Issue 2 , April 1990 , pp. 181 - 186
Copyright
Copyright © Cambridge University Press 1990

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.)

References

Anderson, E.J., Nash, P. & Weber, R. (1982). A counterexample to a conjecture on optimal list ordering. Journal of Applied Probability 19: 730–732.CrossRefGoogle Scholar
Kan, Y.C. & Ross, S. (1980). Optimal list order under partial memory constraints. Journal of Applied Probability 17: 1004–1015.CrossRefGoogle Scholar
Tenenbaum, A. & Nemes, R. (1982) Two spectra of self-organizing sequential search algorithms. SIAM Journal of Computing 11: 557–566.CrossRefGoogle Scholar
Topkis, D.M. (1986). Reordering heuristics for routing in communications networks. Journal of Applied Probability 23: 130–143.CrossRefGoogle Scholar