A two-pass approach for optimally assigning linear tasks to multiprocessor systems

DOI10.1080/00207729608929264MaRDI QIDQ4895708zbMATH OpenOpenAlexFDO

Authors Chiun-Chieh Hsu

Publication date 27 November 1996

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207729608929264

zbMATH Keywords

multiprocessor systemchain-like task

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 622471
• An algorithm for the multiprocessor assignment problem
• Assigning chain-like tasks to a chain-like network
• Task assignment in distributed computing systems
• Optimal task assignment with precedence in distributed computing systems

Cites work

• Efficient allocation of chain-like task on chain-like network computers
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms

This page was built for publication: A two-pass approach for optimally assigning linear tasks to multiprocessor systems

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