Processor Scheduling for Linearly Connected Parallel Processors

DOI10.1109/TC.1986.1676804MaRDI QIDQ3721809zbMATH OpenOpenAlexFDO

Authors Charles E. McDowell, William F. Appelbe

Publication date 1986

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

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

zbMATH Keywords

compilersinterconnection networksinterprocessor communicationlow-level parallel processorparallel architectureparallel computation

Mathematics Subject Classification ID

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

Recommendations

• Scheduling Sequential Loops on Parallel Processors
• On process assignment in parallel computing
• An approach to parallel algorithm design
• Probabilistic analysis of scheduling precedence constrained parallel tasks on multicomputers with contiguous processor allocation
• Parallel programming of linear processor arrays

Cited in

(5)

• On process assignment in parallel computing
• Evaluations of efficiency of parallel-pipeline systems in processing independent task batches
• DVS scheduling in a line or a star network of processors
• Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time
• scientific article; zbMATH DE number 5049925 (Why is no real title available?)

This page was built for publication: Processor Scheduling for Linearly Connected Parallel Processors

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