Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
Analysis of SRPT scheduling: investigating unfairness
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Operating Systems Theory
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Sojourn time asymptotics in the M/G/1 processor sharing queue
Queueing Systems: Theory and Applications
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
Size-based scheduling to improve web performance
ACM Transactions on Computer Systems (TOCS)
The impact of the service discipline on delay asymptotics
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
Mathematics of Operations Research
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint international conference on Measurement and modeling of computer systems
Sojourn time asymptotics in processor-sharing queues
Queueing Systems: Theory and Applications
PBS: a unified priority-based scheduler
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asymptotic properties of sojourn times in multiclass time-shared systems
Probability in the Engineering and Informational Sciences
Sojourn times in (discrete) time shared systems and their continuous time limits
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
Many of recent studies have proved the tail equivalence result for Egalitarian Processor Sharing system: [EQUATION], where B (resp. V) is service requirement (resp. sojourn time) of a customer; for PS, g = 1 - ρ. In this paper, we consider time-shared systems in which the server capacity is shared by existing customers in proportion to (dynamic) weights assigned to customers. We consider two systems, 1) in which the weight of a customer depends on it Age (attained service), and 2) in which the weight depends on the residual processing time (RPT). We allow for a parameterized family of weight functions such that the weight associated with a customer that has received a service (or, has a RPT) of x units is ω(x) = xα for some -∞ g as a function of α.