Optimal partitioning and granularity of uniform task graphs

DOI10.1007/BF02945370MaRDI QIDQ756400zbMATH OpenOpenAlexFDO

Authors Zhongyun Zhang, Guojie Li

Publication date 1991

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02945370

zbMATH Keywords

communicationmultiprocessor systempartitioninggranularities

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 927047
• Efficient algorithms for mapping and partitioning a class of parallel computations
• scientific article; zbMATH DE number 3885290
• UMPa: A multi-objective, multi-level partitioner for communication minimization
• scientific article; zbMATH DE number 42110

Cites work

• scientific article; zbMATH DE number 108569 (Why is no real title available?)
• Assignment of Tasks in a Distributed Processor System with Limited Memory

Cited in

(3)

• scientific article; zbMATH DE number 5990414 (Why is no real title available?)
• Optimal partitioning of random programs across two processors
• UMPa: A multi-objective, multi-level partitioner for communication minimization

This page was built for publication: Optimal partitioning and granularity of uniform task graphs

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