Dynamic scheduling for switched processing systems with substantial service-mode switching times
type: Item
instance of: scholarly article
title: Dynamic scheduling for switched processing systems with substantial service-mode switching times
zbMATH Open document ID: 1166.60057
author: Ying-Chao Hung
author: Chun-Chieh Chang
published in: Queueing Systems
publication date: 2009-03-27T00:00:00Z
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).
reviewed by: Marina Gorunescu
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B36
zbMATH DE Number: 5534451
zbMATH Keywords: Switched processing systems
zbMATH Keywords: service-mode switching time
zbMATH Keywords: dynamic scheduling
zbMATH Keywords: perturbed lyapunov function
zbMATH Keywords: delay
describes a project that uses: Qhull
MaRDI profile type: Publication
full work available at URL: s11134-008-9088-3
OpenAlex ID: W2067012567
cites work: Queueing dynamics and maximal throughput scheduling in switched processing systems
cites work: Queueing and scheduling in random environments
cites work: Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
cites work: MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
cites work: Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality
cites work: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
cites work: Q4421713
cites work: Q3344923
cites work: Scheduling and stability aspects of a general class of parallel processing systems
cites work: The quickhull algorithm for convex hulls
cites work: Stability and Control of Acyclic Stochastic Processing Networks With Shared Resources
DOI: 10.1007/S11134-008-9088-3
description: scientific article; zbMATH DE number 5534451