A survey of scheduling methods for multiprocessor systems
From MaRDI portal
Publication:1153687
DOI10.1007/BF01086545zbMath0463.68052MaRDI QIDQ1153687
T. A. Tushkina, K. V. Shakhbazyan
Publication date: 1975
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling with Deadlines and Loss Functions
- A Dynamic Programming Approach to Sequencing Problems
- An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
- Automatic Assignment of Computations in a Variable Structure Computer System
- Models of Computational Systems-Cyclic to Acyclic Graph Transformations
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Experiments on Models of Computations and Systems
- An Algorithm for the Traveling Salesman Problem
- Scheduling Parallel Computations
- Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations
- Path Length Computations on Graph Models of Computations
- Bounds on Multiprocessing Timing Anomalies
- Optimal Sequencing of Two Equivalent Processors
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Optimal Scheduling Strategies in a Multiprocessor System
This page was built for publication: A survey of scheduling methods for multiprocessor systems
