Math @ Duke

Publications [#235797] of Robert Calderbank
Papers Published
 Calderbank, AR; Coffman, EG; Flatto, L, SEQUENCING PROBLEMS IN TWOSERVER SYSTEMS.,
Mathematics of Operations Research, vol. 10 no. 4
(1985),
pp. 585598
(last updated on 2018/10/17)
Abstract: We analyze a service system in which two identical servers move one at a time along a linear array of N positions. Requests for service, each designating one of the N positions, join a firstinfirst queue, where processing of the nth request does not begin until processing of the (n1)th requested is completed. Processing the nth request entails determining which server to move, moving this server to the requested position, and then performing the service. Several potential applications of the model are mentioned, the most notable being the design of computer storage systems with multiple access devices. Within a simple probability model we compare serverselection policies in terms of the equilibrium expected distance a server is moved in processing a request. Distance is measured under two regimes, both assigning a unit distance between adjacent positions.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

