Bounds on the Scheduling of Typed Task Systems
- 1 August 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (3) , 541-551
- https://doi.org/10.1137/0209040
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Efficient scheduling of tasks without full use of processor resourcesTheoretical Computer Science, 1980
- Worst Case Analysis of Two Scheduling AlgorithmsSIAM Journal on Computing, 1977
- Bounds for Multiprocessor Scheduling with Resource ConstraintsSIAM Journal on Computing, 1975
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- First version of a data flow procedure languagePublished by Springer Nature ,1974
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor SystemsJournal of the ACM, 1970
- Optimal Preemptive Scheduling on Two-Processor SystemsIEEE Transactions on Computers, 1969
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Properties of a Model for Parallel Computations: Determinacy, Termination, QueueingSIAM Journal on Applied Mathematics, 1966