Optimal Scheduling Strategies in a Multiprocessor System

DOI10.1109/TC.1972.5008918MaRDI QIDQ5640724zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5640724)