Stability of scheduling policies for processing networks

Thomas I. Seidman, Lawrence E. Holloway, Gregory Seidman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


This paper considers the stability of a network of processors executing a set of tasks on orders that arrive either externally or from other processors in the network. These orders wait at each task until a control policy assigns the processor to execute the orders for that task. We consider a class of control policies, work-conserving control policies, that consider look-ahead of workload from existing orders. These policies are shown, in general, to ensure that work accumulation in the system is bounded and thus the system is stable. We then consider the class of apparently-work-conserving controllers, which operate on task-level information instead of global information. By adding supplemental information dynamics, it is shown that these apparently-work-conserving controllers can be made equivalent to work-conserving and thus ensure stability.

Original languageEnglish
Title of host publication2022 IEEE 61st Conference on Decision and Control, CDC 2022
Number of pages8
ISBN (Electronic)9781665467612
StatePublished - 2022
Event61st IEEE Conference on Decision and Control, CDC 2022 - Cancun, Mexico
Duration: Dec 6 2022Dec 9 2022

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370


Conference61st IEEE Conference on Decision and Control, CDC 2022

Bibliographical note

Publisher Copyright:
© 2022 IEEE.

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization


Dive into the research topics of 'Stability of scheduling policies for processing networks'. Together they form a unique fingerprint.

Cite this