Processor-shared service systems with queue-dependent processors
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 834608 (Why is no real title available?)
- scientific article; zbMATH DE number 975785 (Why is no real title available?)
- A queueing system with queue-dependent servers and finite capacity
- An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
- Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach
- Performance analysis of the simultaneous optical multi-processor exchange bus
- Preemptive hybrid flowshop scheduling problem of interval orders
- Queue-dependent servers
- Resource Optimization of a Parallel Computer for Multiple Vector Processing
- Response times in processor-shared queuses with state-dependent arrival rates
- Sojourn times in a processor sharing queue with service interruptions
- Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies
- Time-shared Systems
Cited in
(5)- Architecture and robustness tradeoffs in speed-scaled queues with application to energy management
- Finite capacity M/M/r queueing system with queue-dependent servers
- Admission control for finite capacity queueing model with general retrial times and state-dependent rates
- Modeling and optimization of a product-service system with additional service capacity and impatient customers
- Equivalent single-queue-single-server model for a pentium processor
This page was built for publication: Processor-shared service systems with queue-dependent processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886866)