Optimal Scheduling Strategies in a Multiprocessor System

DOI10.1109/TC.1972.5008918zbMath0232.68014OpenAlexW2167384564MaRDI QIDQ5640724

Unnamed Author, C. V. Ramamoorthy, K. Mani Chandy

Publication date: 1972

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1972.5008918

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items (13)

Richard Bellman's contributions to computer science ⋮ Scheduling problems in parallel systems for telecommunications ⋮ Data-dependency graph transformations for instruction scheduling ⋮ A survey of scheduling methods for multiprocessor systems ⋮ Methods and means of parallel processing of information ⋮ Off-line mapping of multi-rate dependent task sets to many-core platforms ⋮ Communication contention in APN list scheduling algorithm ⋮ Scheduling DAGs with random parallel tasks on binarily partitionable systems ⋮ A standard task graph set for fair evaluation of multiprocessor scheduling algorithms ⋮ New bounds on time and number of processors for multiprocessor optimal schedules ⋮ New bounds on time and number of processors for multiprocessor optimal schedules ⋮ Optimal multiprocessor task scheduling using dominance and equivalence relations ⋮ A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications

This page was built for publication: Optimal Scheduling Strategies in a Multiprocessor System