A survey of scheduling methods for multiprocessor systems
From MaRDI portal
(Redirected from Publication:1153687)
Cites work
- scientific article; zbMATH DE number 3570347 (Why is no real title available?)
- scientific article; zbMATH DE number 3441612 (Why is no real title available?)
- scientific article; zbMATH DE number 3441613 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- An Algorithm for the Traveling Salesman Problem
- An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
- Automatic Assignment of Computations in a Variable Structure Computer System
- Bounds on Multiprocessing Timing Anomalies
- Experiments on Models of Computations and Systems
- Models of Computational Systems-Cyclic to Acyclic Graph Transformations
- Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations
- Optimal Scheduling Strategies in a Multiprocessor System
- Optimal Sequencing of Two Equivalent Processors
- Path Length Computations on Graph Models of Computations
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Scheduling Parallel Computations
- Scheduling with deadlines and loss functions
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)