Sequencing two servers on a sphere

DOI10.1080/15326348508807002MaRDI QIDQ3217405zbMATH OpenOpenAlexFDO

Authors Robert Calderbank, E. G. jun. Coffman, L. Flatto

Publication date 1985

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326348508807002

zbMATH Keywords

equilibrium measure for the angular distanceservice system in which two servers move independently on the surface of the n-dimensional sphere

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Sequencing Problems in Two-Server Systems
• Optimal order for two servers in tandem
• Scheduling on two parallel machines with two dedicated servers
• A randomized algorithm for two servers on the line.
• On fast algorithms for two servers
• scientific article; zbMATH DE number 4215366
• Optimal routing to two parallel heterogeneous servers with resequencing
• A scheduling problem for several parallel servers
• scientific article; zbMATH DE number 1409906

Cited in

(3)

• Stochastic dominance and the bijective ratio of online algorithms
• Optimal Computer Disk Access
• Optimal Sequencing in Multiserver Systems

This page was built for publication: Sequencing two servers on a sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217405)