![Processor-shared service systems with queue-dependent processors [An article from: Computers and Operations Research]](https://www.ebooknetworking.net/books/B00/0RR/bigB000RR47RS.jpg)
Processor-shared service systems with queue-dependent processors [An article from: Computers and Operations Research]
Book Details
Author(s)M. Jain, G.C. Sharma, C. Shekhar
PublisherElsevier
ISBN / ASINB000RR47RS
ISBN-13978B000RR47R3
AvailabilityAvailable for download now
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2005. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
In this investigation, we analyze the finite queue-dependent heterogeneous multiprocessor service system in which processors are shared by more than one job. Whenever, the queue length of jobs in the system reaches a threshold value N"j(j=1,2,...,r-1), the (j+1)th processor starts the processing of the jobs and continues till queue length is again decreased to the same level. Steady-state queue size distribution is obtained using recursive method considering Markovian arrival and service times. We derive the system characteristics viz. expected number of jobs in the system, throughput of the system, probability that jth (j=2,3,...,r) processor rendering the service etc. A cost relationship is constructed to determine the optimal threshold levels for processors being active in order to gain maximum net profit. For illustration purpose, tables and graphs are also provided.
Description:
In this investigation, we analyze the finite queue-dependent heterogeneous multiprocessor service system in which processors are shared by more than one job. Whenever, the queue length of jobs in the system reaches a threshold value N"j(j=1,2,...,r-1), the (j+1)th processor starts the processing of the jobs and continues till queue length is again decreased to the same level. Steady-state queue size distribution is obtained using recursive method considering Markovian arrival and service times. We derive the system characteristics viz. expected number of jobs in the system, throughput of the system, probability that jth (j=2,3,...,r) processor rendering the service etc. A cost relationship is constructed to determine the optimal threshold levels for processors being active in order to gain maximum net profit. For illustration purpose, tables and graphs are also provided.
