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

DOI10.1007/S11134-008-9088-3MaRDI QIDQ1007135zbMATH OpenOpenAlexFDO

Authors 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

delaydynamic schedulingperturbed lyapunov functionservice-mode switching timeSwitched processing systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36)

Review text

For the canonical models concerning the switched processing systems (SPS), the authors propose a new scheduling strategy, called ``dynamic scheduling, including substantial service-mode switching times. In addition, an extended scheduling strategy -- practical dynamic cone policy -- is also developed for practical purposes. Moreover, a simulation study is performed in order to show that this approach outperforms another throughput-maximizing policy (i.e. BatchAdapt).

Recommendations

• Modeling, scheduling, and simulation of switched processing systems
• Queueing dynamics and maximal throughput scheduling in switched processing systems
• Dynamic scheduling with reconfiguration delays
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Optimal dynamic scheduling of a general class of parallel-processing queueing systems

Cites work

• Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality
• scientific article; zbMATH DE number 3878095 (Why is no real title available?)
• scientific article; zbMATH DE number 1972910 (Why is no real title available?)
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Queueing and scheduling in random environments
• Queueing dynamics and maximal throughput scheduling in switched processing systems
• Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
• Scheduling and stability aspects of a general class of parallel processing systems
• Stability and Control of Acyclic Stochastic Processing Networks With Shared Resources
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• The quickhull algorithm for convex hulls

Cited in

(9)

• Polling: past, present, and perspective
• Uniform design over general input domains with applications to target region estimation in computer experiments
• Projection-based iterative mode scheduling for switched systems
• Dynamic scheduling with reconfiguration delays
• Locating infinite discontinuities in computer experiments
• Fuzzy scheduling strategy for generalized switched server systems and its robustness over system heterogeneity
• scientific article; zbMATH DE number 2042676 (Why is no real title available?)
• Modeling, scheduling, and simulation of switched processing systems
• Dynamic scheduling in single-server multiclass service systems with unit buffers

Describes a project that uses

Uses Software

• Qhull

This page was built for publication: Dynamic scheduling for switched processing systems with substantial service-mode switching times

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