Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
The M/G/1 queue with processor sharing and its relation to a feedback queue
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Statistical analysis of generalized processor sharing scheduling discipline
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM (JACM)
Queueing Systems: Theory and Applications
Insensitivity in processor-sharing networks
Performance Evaluation
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
Queueing Systems: Theory and Applications
Sojourn Times in the M/PH/1 Processor Sharing Queue
Queueing Systems: Theory and Applications
Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling
Queueing Systems: Theory and Applications
A sample path relation for the sojourn times in G/G/1-PS systems and its applications
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
On the stability of the multi-queue multi-server processor sharing with limited service
Queueing Systems: Theory and Applications
Myopic versus clairvoyant admission policies in wireless networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes
Automation and Remote Control
On sojourn times in M/GI systems under state-dependent processor sharing
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We consider a system where the arrivals form a Poisson process and the required service times of the requests are exponentially distributed. The requests are served according to the state-dependent (Cohen's generalized) processor sharing discipline, where each request in the system receives a service capacity which depends on the actual number of requests in the system. For this system we derive systems of ordinary differential equations for the LST and for the moments of the conditional waiting time of a request with given required service time as well as a stable and fast recursive algorithm for the LST of the second moment of the conditional waiting time, which in particular yields the second moment of the unconditional waiting time. Moreover, asymptotically tight upper bounds for the moments of the conditional waiting time are given. The presented numerical results for the first two moments of the sojourn times in M/M/m驴PS systems show that the proposed algorithms work well.