On linear schedules of task graphs for generalized LogP-machines

DOI10.1007/BFB0002832MaRDI QIDQ4537058zbMATH OpenFDO

Authors Wolf Zimmermann, Jörn Eisenbiegler, Welf M. Löwe

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
• Scheduling inverse trees under the communication model of the LogP-machine
• On scheduling send-graphs and receive-graphs under the LogP-model
• Scheduling balanced task-graphs to LogP-machines
• List scheduling of general task graphs under LogP

Cited in

(9)

• Scheduling inverse trees under the communication model of the LogP-machine
• Scheduling outtrees of height one in the LogP model
• Scheduling balanced task-graphs to LogP-machines
• List scheduling of general task graphs under LogP
• On scheduling send-graphs and receive-graphs under the LogP-model
• scientific article; zbMATH DE number 1894382 (Why is no real title available?)
• scientific article; zbMATH DE number 2090582 (Why is no real title available?)
• scientific article; zbMATH DE number 2090647 (Why is no real title available?)
• Some Results On Scheduling Flat Trees In LogP Model

This page was built for publication: On linear schedules of task graphs for generalized LogP-machines

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