Some Results On Scheduling Flat Trees In LogP Model

DOI10.1080/03155986.1999.11732369MaRDI QIDQ5888085zbMATH OpenOpenAlexFDO

Authors Iskander Kort, Denis Trystram

Publication date 21 April 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

schedulingjoin graphscommunicationsLogPfork graphs

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Scheduling outtrees of height one in the LogP model
• On scheduling send-graphs and receive-graphs under the LogP-model
• Scheduling inverse trees under the communication model of the LogP-machine
• scientific article; zbMATH DE number 1760098
• List scheduling of general task graphs under LogP

Cited in

(1)

• 1-optimality of static BSP computations: Scheduling independent chains as a case study.

This page was built for publication: Some Results On Scheduling Flat Trees In LogP Model

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