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

Kentaro Hoshi, Yoshiaki Shikata, Yoshitaka Takahashi, Naohisa Komatsu

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)2247-2253
Number of pages7
JournalIEICE Transactions on Communications
VolumeE94-B
Issue number8
DOIs
Publication statusPublished - 2011 Aug

Fingerprint

Computer systems

Keywords

  • Processor-sharing
  • Queues
  • Renewal input
  • Sojourn-time
  • Tele-traffic analysis
  • Unfinished-work

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Software

Cite this

Mean approximate formulas for GI/G/1 processor-sharing system. / Hoshi, Kentaro; Shikata, Yoshiaki; Takahashi, Yoshitaka; Komatsu, Naohisa.

In: IEICE Transactions on Communications, Vol. E94-B, No. 8, 08.2011, p. 2247-2253.

Research output: Contribution to journalArticle

Hoshi, K, Shikata, Y, Takahashi, Y & Komatsu, N 2011, 'Mean approximate formulas for GI/G/1 processor-sharing system', IEICE Transactions on Communications, vol. E94-B, no. 8, pp. 2247-2253. https://doi.org/10.1587/transcom.E94.B.2247
Hoshi, Kentaro ; Shikata, Yoshiaki ; Takahashi, Yoshitaka ; Komatsu, Naohisa. / Mean approximate formulas for GI/G/1 processor-sharing system. In: IEICE Transactions on Communications. 2011 ; Vol. E94-B, No. 8. pp. 2247-2253.
@article{1cf485fb665046a7b91e4165def7edd5,
title = "Mean approximate formulas for GI/G/1 processor-sharing system",
abstract = "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.",
keywords = "Processor-sharing, Queues, Renewal input, Sojourn-time, Tele-traffic analysis, Unfinished-work",
author = "Kentaro Hoshi and Yoshiaki Shikata and Yoshitaka Takahashi and Naohisa Komatsu",
year = "2011",
month = "8",
doi = "10.1587/transcom.E94.B.2247",
language = "English",
volume = "E94-B",
pages = "2247--2253",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

TY - JOUR

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

AU - Hoshi, Kentaro

AU - Shikata, Yoshiaki

AU - Takahashi, Yoshitaka

AU - Komatsu, Naohisa

PY - 2011/8

Y1 - 2011/8

N2 - 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.

AB - 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.

KW - Processor-sharing

KW - Queues

KW - Renewal input

KW - Sojourn-time

KW - Tele-traffic analysis

KW - Unfinished-work

UR - http://www.scopus.com/inward/record.url?scp=79961077742&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79961077742&partnerID=8YFLogxK

U2 - 10.1587/transcom.E94.B.2247

DO - 10.1587/transcom.E94.B.2247

M3 - Article

VL - E94-B

SP - 2247

EP - 2253

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 8

ER -