Mean approximate formulas for GI/G/1 processor-sharing system

Kentaro Hoshi*, Yoshiaki Shikata, Yoshitaka Takahashi, Naohisa Komatsu

*この研究の対応する著者

研究成果: Article査読

抄録

The processor-sharing (PS) rule arises as a natural paradigm in a variety of practical situations, including time-shared computer systems. Although there has been much work on Poisson-input queueing analysis for the PS rule, there have been few results for renewalinput GI/G/1 (PS) systems. We consider the GI/G/1 (PS) system to provide develop a two-moment approximation for the mean performance measures. We derive the relationship between the mean unfinished work and the conditional mean sojourn time for the GI/G/1 (PS) system. Using this relationship, we derive approximate formulas for the mean conditional sojourn time, mean sojourn time, and the mean number of customers in the GI/G/1 (PS) system. Numerical examples are presented to compare the approximation with exact and simulated results. We show that the proposed approximate formulas have good accuracy.

本文言語English
ページ(範囲)2247-2253
ページ数7
ジャーナルIEICE Transactions on Communications
E94-B
8
DOI
出版ステータスPublished - 2011 8月

ASJC Scopus subject areas

  • 電子工学および電気工学
  • コンピュータ ネットワークおよび通信
  • ソフトウェア

フィンガープリント

「Mean approximate formulas for GI/G/1 processor-sharing system」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル