A survey of scheduling methods for multiprocessor systems
From MaRDI portal
Publication:1153687
DOI10.1007/BF01086545zbMATH Open0463.68052MaRDI QIDQ1153687FDOQ1153687
Authors: K. V. Shakhbazyan, T. A. Tushkina 
Publication date: 1975
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
Cites Work
- An Algorithm for the Traveling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Title not available (Why is that?)
- Bounds on Multiprocessing Timing Anomalies
- Scheduling with deadlines and loss functions
- Optimal Sequencing of Two Equivalent Processors
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Optimal Scheduling Strategies in a Multiprocessor System
- Scheduling Parallel Computations
- An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automatic Assignment of Computations in a Variable Structure Computer System
- Models of Computational Systems-Cyclic to Acyclic Graph Transformations
- Experiments on Models of Computations and Systems
- Path Length Computations on Graph Models of Computations
Cited In (1)
Uses Software
This page was built for publication: A survey of scheduling methods for multiprocessor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153687)
