A novel approach to admission and flow control in generalized processor sharing (GPS) schedulers

zbMATH Open1050.68016MaRDI QIDQ2765663FDOQ2765663

Authors: Robert Szabo, P. Barta, F. Németh, J. Bíró 

Publication date: 5 August 2002

Recommendations

• scientific article; zbMATH DE number 1717158
• Generalized processor sharing: Characterization of the admissible region and selection of optimal weights
• Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline
• A heuristic flow-decomposition approach for generalized processor sharing under self-similar traffic
• Bandwidth allocation for multiple qualities of service using generalized processor sharing

zbMATH Keywords

Call Admission Control

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (6)

• CAC procedures for leaky bucket-constrained sources
• Price-coupled scheduling for differentiated services: Gcµversus GPS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A heuristic flow-decomposition approach for generalized processor sharing under self-similar traffic

This page was built for publication: A novel approach to admission and flow control in generalized processor sharing (GPS) schedulers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765663)