Reducing Delay in Preemptive Repeat Priority Queues
From MaRDI portal
Recommendations
- The discrete-time preemptive repeat identical priority queue
- Mixing of non-preemptive and preemptive repeat priority disciplines
- Queuing with preemptive priorities or with breakdown
- scientific article; zbMATH DE number 967316
- Threshold-based interventions to optimize performance in preemptive priority queues
Cited in
(12)- Threshold-based interventions to optimize performance in preemptive priority queues
- T-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks
- A general framework for pricing Asian options under stochastic volatility on parallel architectures
- (N, n)-preemptive-priority M/G/1 queues with finite and infinite buffers
- Replicate to the shortest queues
- The discrete-time preemptive repeat identical priority queue
- Optimization of traffic control in \(MMAP[2]/PH[2]/S\) priority queueing model with \(PH\) retrial times and the preemptive repeat policy
- On a general mixed priority queue with server discretion
- Reducing Delivery Delay in HRM Tree
- scientific article; zbMATH DE number 2065978 (Why is no real title available?)
- Computable Error Bounds of Laplace Inversion for Pricing Asian Options
- Mixing of non-preemptive and preemptive repeat priority disciplines
This page was built for publication: Reducing Delay in Preemptive Repeat Priority Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3634988)