Dynamic scheduling for switched processing systems with substantial service-mode switching times
From MaRDI portal
Publication:1007135
DOI10.1007/S11134-008-9088-3zbMath1166.60057OpenAlexW2067012567MaRDI QIDQ1007135
Chun-Chieh Chang, Ying-Chao Hung
Publication date: 27 March 2009
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-008-9088-3
delaydynamic schedulingperturbed lyapunov functionservice-mode switching timeSwitched processing systems
Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36)
Related Items (4)
Polling: past, present, and perspective ⋮ Dynamic scheduling with reconfiguration delays ⋮ Uniform design over general input domains with applications to target region estimation in computer experiments ⋮ Locating Infinite Discontinuities in Computer Experiments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Queueing dynamics and maximal throughput scheduling in switched processing systems
- Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
- The quickhull algorithm for convex hulls
- Queueing and scheduling in random environments
- Scheduling and stability aspects of a general class of parallel processing systems
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Stability and Control of Acyclic Stochastic Processing Networks With Shared Resources
This page was built for publication: Dynamic scheduling for switched processing systems with substantial service-mode switching times