Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
Sharing a Processor Among Many Job Classes
Journal of the ACM (JACM)
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A Skorokhod Problem formulation and large deviation analysis of a processor sharing model
Queueing Systems: Theory and Applications
Large deviations and the generalized processor sharing scheduling for a multiple-queue system
Queueing Systems: Theory and Applications
Large deviations analysis of the generalized processor sharing policy
Queueing Systems: Theory and Applications
On a reduced load equivalence for fluid queues under subexponentiality
Queueing Systems: Theory and Applications
Scheduling strategies and long-range dependence
Queueing Systems: Theory and Applications
Sojourn time asymptotics in the M/G/1 processor sharing queue
Queueing Systems: Theory and Applications
Waiting-Time Asymptotics for the M/G/2 Queue with Heterogeneous Servers
Queueing Systems: Theory and Applications
Tail Asymptotics for HOL Priority Queues Handling a Large Number of Independent Stationary Sources
Queueing Systems: Theory and Applications
A Reduced-Load Equivalence for Generalised Processor Sharing Networks with Long-Tailed Input Flows
Queueing Systems: Theory and Applications
Finite buffer queue with generalized processor sharing and heavy-tailed input processes
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
Asymptotic convergence of scheduling policies with respect to slowdown
Performance Evaluation
The Asymptotic Workload Behavior of Two Coupled Queues
Queueing Systems: Theory and Applications
Heavy Traffic Analysis of Two Coupled Processors
Queueing Systems: Theory and Applications
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
Queueing Systems: Theory and Applications
Generalized processor sharing with light-tailed and heavy-tailed input
IEEE/ACM Transactions on Networking (TON)
Mixed scheduling disciplines for network flows
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
Two-level processor-sharing scheduling disciplines: mean delay analysis
Proceedings of the joint international conference on Measurement and modeling of computer systems
A survey on statistical bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Optimal call admission control on a single link with a GPS scheduler
IEEE/ACM Transactions on Networking (TON)
Asymptotic regimes and approximations for discriminatory processor sharing
ACM SIGMETRICS Performance Evaluation Review
Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling
Queueing Systems: Theory and Applications
Sample-path large deviations for generalized processor sharing queues with Gaussian inputs
Performance Evaluation - Long range dependence and heavy tail distributions
Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements
Performance Evaluation - Long range dependence and heavy tail distributions
Analysis of cycle stealing with switching times and thresholds
Performance Evaluation
Sojourn time asymptotics in processor-sharing queues
Queueing Systems: Theory and Applications
A survey on discriminatory processor sharing
Queueing Systems: Theory and Applications
GPS scheduling: selection of optimal weights and comparison with strict priorities
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
M/G/1/MLPS compared to M/G/1/PS
Operations Research Letters
On the twin measure and queueing systems predictability
Performance Evaluation
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
Queueing Systems: Theory and Applications
Analysis of multiclass feedback queues and its application to a packet scheduling problem
Proceedings of the 4th International Conference on Queueing Theory and Network Applications
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Towards more effective utilization of computer systems
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Minimizing slowdown in heterogeneous size-aware dispatching systems
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Hi-index | 0.00 |
While the (Egalitarian) Processor-Sharing (PS) discipline offers crucial insights in the performance of fair resource allocation mechanisms, it is inherently limited in analyzing and designing differentiated scheduling algorithms such as Weighted Fair Queueing and Weighted Round-Robin. The Discriminatory Processor-Sharing (DPS) and Generalized Processor-Sharing (GPS) disciplines have emerged as natural generalizations for modeling the performance of such service differentiation mechanisms. A further extension of the ordinary PS policy is the Multilevel Processor-Sharing (MLPS) discipline, which has captured a pivotal role in the analysis, design and implementation of size-based scheduling strategies. We review various key results for DPS, GPS and MLPS models, highlighting to what extent these disciplines inherit desirable properties from ordinary PS or are capable of delivering service differentiation.