Dynamic scheduling for switched processing systems with substantial service-mode switching times

DOI10.1007/s11134-008-9088-3zbMath1166.60057MaRDI QIDQ1007135

Ying-Chao Hung, Chun-Chieh Chang

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

zbMATH Keywords

delay; dynamic scheduling; perturbed lyapunov function; service-mode switching time; Switched processing systems

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B36: Stochastic scheduling theory in operations research

Related Items

Uniform design over general input domains with applications to target region estimation in computer experiments

Uses Software

• Qhull

Cites Work

• 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
• Unnamed Item
• Unnamed Item