Scheduling and stability aspects of a general class of parallel processing systems
DOI10.2307/1427501zbMATH Open0768.60083OpenAlexW1986046071MaRDI QIDQ5286072FDOQ5286072
Authors: Nicholas Bambos, Jean Walrand 
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
Recommendations
- On stability and performance of parallel processing systems
- Complexity of Scheduling Parallel Task Systems
- Scheduling parallel processors: Structural properties and optimal policies
- Publication:2779606
- A class of generalized multiprocessor scheduling problems
- Parallel algorithms for solution of problems in scheduling theory
- Sequential and parallel computations in the general scheduling problem
throughput maximizationjob processing under compatibility constraintsmultiprocessor queueing systemspolicies for scheduling
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)
Cited In (7)
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
- Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
- Dynamic scheduling for switched processing systems with substantial service-mode switching times
- On stability and performance of parallel processing systems
- On stationary tandem queueing networks with job feedback
- Queueing networks of random link topology: stationary dynamics of maximal throughput schedules
- Title not available (Why is that?)
This page was built for publication: Scheduling and stability aspects of a general class of parallel processing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286072)
