Scheduling and stability aspects of a general class of parallel processing systems

DOI10.2307/1427501zbMath0768.60083OpenAlexW1986046071MaRDI QIDQ5286072

Jean Walrand, Nicholas Bambos

Publication date: 29 June 1993

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427501

zbMATH Keywords

throughput maximizationjob processing under compatibility constraintsmultiprocessor queueing systemspolicies for scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. ⋮ Dynamic scheduling for switched processing systems with substantial service-mode switching times ⋮ Queueing networks of random link topology: stationary dynamics of maximal throughput schedules ⋮ On stationary tandem queueing networks with job feedback

This page was built for publication: Scheduling and stability aspects of a general class of parallel processing systems