Performance Limits of Parallel Server Systems Based on Deterministic Optimal Routing

スポンサーリンク

概要

• 論文の詳細を見る

• This paper describes the performance limits of parallel server (PS) systems in which every sever has its own queue. The average packet delays of PS systems depend on the routing policy, which assigns each arriving packet to one of the parallel servers. The optimal routings are numerically calculated based on the condition that the input traffic is completely deterministic. These optimal routings show that under a heavy traffic load, PS systems outperform a single server (SS) system. When an infinite number of packets arrive simultaneously, the expected average delay of a PS system that includes 10 servers in 20% smaller than that of and SS system but is 60% larger than that of an SS system that has "shortest remaining processing time" discipline.

• 一般社団法人情報処理学会の論文
• 1999-12-15

著者

• SHINJO Kazumasa

  ATR Adaptive Communications Research Laboratories

• Shinjo K

  Atr Adpative Communications Research Laboratories

• OIDA KAZUMASA

  ATR Adpative Communications Research Laboratories

• Oida K

  Atr Adpative Communications Research Laboratories

• Oida Kazumasa

  Atr Adaptive Communications Research Laboratories

関連論文

• Applying the Hamiltonian Algorithm to Optimize Joint Photographic Expert Group (JPEG) Quantization Tables for Medical Ultrasonic Echo Images
• Performance Limits of Parallel Server Systems Based on Deterministic Optimal Routing
• Performance Limits of Parallel Server Systems based on Deterministic Optimal Routing

スポンサーリンク