Scheduling balanced task-graphs to LogP-machines

DOI10.1016/S0167-8191(00)00030-2MaRDI QIDQ1575595zbMATH OpenFDO

Authors Welf M. Löwe, Wolf Zimmermann

Publication date 21 August 2000

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-8191(00)00030-2

zbMATH Keywords

granularityLogP-modelscheduling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1760098
• On scheduling send-graphs and receive-graphs under the LogP-model
• scientific article; zbMATH DE number 2090582
• CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
• Scheduling inverse trees under the communication model of the LogP-machine

Cited in

(5)

• Scheduling inverse trees under the communication model of the LogP-machine
• On scheduling send-graphs and receive-graphs under the LogP-model
• scientific article; zbMATH DE number 1760098 (Why is no real title available?)
• scientific article; zbMATH DE number 1863252 (Why is no real title available?)
• scientific article; zbMATH DE number 2090582 (Why is no real title available?)

This page was built for publication: Scheduling balanced task-graphs to LogP-machines

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