CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS

DOI10.1142/S0129054101000862zbMath1319.68042MaRDI QIDQ5249290

No author found.

Publication date: 30 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

performance evaluationoptimal routingparallel serversdeterministic input traffic

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Analysis of job assignment with batch arrivals among heterogeneous servers

Cites Work

• Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
• Individually optimal routing in parallel systems
• Deciding Which Queue to Join: Some Counterexamples
• Comparison of Policies for Routing Customers to Parallel Queueing Systems
• A simple dynamic routing problem
• Optimality of the shortest line discipline
• On the optimal assignment of customers to parallel servers
• The Regulation of Queue Size by Levying Tolls

This page was built for publication: CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS