Mean Approximate Formulas for GI/G/1 Processor-Sharing System
| العنوان: | Mean Approximate Formulas for GI/G/1 Processor-Sharing System |
|---|---|
| المؤلفون: | Kentaro Hoshi, Yoshiaki Shikata, Yoshitaka Takahashi, Naohisa Komatsu |
| المصدر: | IEICE Transactions on Communications. :2247-2253 |
| بيانات النشر: | Institute of Electronics, Information and Communications Engineers (IEICE), 2011. |
| سنة النشر: | 2011 |
| مصطلحات موضوعية: | Discrete mathematics, Mean sojourn time, Processor sharing, Queueing theory, Computer Networks and Communications, Computer science, Real-time computing, Electrical and Electronic Engineering, Variety (universal algebra), Conditional expectation, Queue, Software |
| الوصف: | 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 renewal-input 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. |
| تدمد: | 1745-1345 0916-8516 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::e1ade03239c085b27815d227fb8cbe5b https://doi.org/10.1587/transcom.e94.b.2247 |
| رقم الأكسشن: | edsair.doi...........e1ade03239c085b27815d227fb8cbe5b |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 17451345 09168516 |
|---|