Hostname: page-component-89b8bd64d-9prln Total loading time: 0 Render date: 2026-05-07T03:28:17.679Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal Sequencing in Multiserver Systems

Published online by Cambridge University Press:  27 July 2009

Dimitrios G. Pandelis  and
Demosthenis Teneketzis
Dimitrios G. Pandelis
Affiliation:
Environmental Research Institute of Michigan, P.O. Box 134001, Ann Arbor, Michigan 48113-4001
Demosthenis Teneketzis
Affiliation:
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109-2122
Get access Rights & Permissions [Opens in a new window]

Extract

We analyze service systems where Nservers (N > 2) move one at a time along an array of stations to satisfy a known number of requests for service. Processing a request consists of determining the server to satisfy the request. The cost of processing a request is determined by the distance the server that performs the request has to move. We determine qualitative properties of sequencing strategies that minimize the expected cost incurred by the service of all requests when the array of stations is on a circle or an interval.

Information

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

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

Article purchase

Temporarily unavailable

References

1.Birnbaum, J.S. (1982). Computers: A survey of trends and limitations. Science 215: 760–765.CrossRefGoogle ScholarPubMed
2.Calderbank, A.R., Coffman, E.G. Jr, & Flatto, L. (1985). Sequencing problems in two-server systems. Mathematics of Operations Research 10: 585–598.CrossRefGoogle Scholar
3.Calderbank, A.R., Coffman, E.G. Jr, & Flatto, L. (1985). Sequencing two servers on a sphere. Stochastic Models 1: 17–28.CrossRefGoogle Scholar
4.Calderbank, A.R., Coffman, E.G. Jr, & Flatto, L. (1988). Optimal directory placement on disk storage devices. Journal of the Association for Computing Machinery 35: 433–446.CrossRefGoogle Scholar
5.Hofri, M. (1983). Should the two-headed disk be greedy? — Yes, it should. Information Processing Letters 16: 83–85.CrossRefGoogle Scholar