Processor-shared service systems with queue-dependent processors

Authors:
Madhu Jain;G. C. Sharma;Chandra Shekhar
Affiliations:
Department of Mathematics, Institute of Basic Science, Khandari, Agra 282002, India;Department of Mathematics, Institute of Basic Science, Khandari, Agra 282002, India;Department of Mathematics, D.A.V. (PG) College, Dehra Dun 248001, India
Venue:
Computers and Operations Research
Year:
2005

Citing 6
Cited 1

Task routing and resequencing in a multiprocessor system

Journal of Systems and Software
Time-shared Systems: a theoretical treatment

Journal of the ACM (JACM)
Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies

Performance Evaluation
Modeling and Analysis of Task Migration in Shared-Memory Multiprocessor Computer Systems

MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
A time-sharing architecture for complex real-time systems

ICECCS '95 Proceedings of the 1st International Conference on Engineering of Complex Computer Systems
Queue Structures for Shared-Memory Multiprocessor Systems

SS '01 Proceedings of the 34th Annual Simulation Symposium (SS01)

Modeling and optimization of a product-service system with additional service capacity and impatient customers

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 Nj(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.