Dynamic scheduling for switched processing systems with substantial service-mode switching times (Q1007135): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1007/s11134-008-9088-3 / rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S11134-008-9088-3 / rank | |||
Normal rank |
Latest revision as of 12:35, 10 December 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
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
0 references
0 references