Dynamic scheduling for switched processing systems with substantial service-mode switching times (Q1007135): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Queueing dynamics and maximal throughput scheduling in switched processing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queueing and scheduling in random environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queueing networks of random link topology: stationary dynamics of maximal throughput schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and stability aspects of a general class of parallel processing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickhull algorithm for convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and Control of Acyclic Stochastic Processing Networks With Shared Resources / rank
 
Normal rank

Revision as of 04:29, 29 June 2024

scientific article
Language Label Description Also known as
English
Dynamic scheduling for switched processing systems with substantial service-mode switching times
scientific article

    Statements

    Dynamic scheduling for switched processing systems with substantial service-mode switching times (English)
    0 references
    0 references
    0 references
    27 March 2009
    0 references
    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).
    0 references
    Switched processing systems
    0 references
    service-mode switching time
    0 references
    dynamic scheduling
    0 references
    perturbed lyapunov function
    0 references
    delay
    0 references

    Identifiers