List scheduling of general task graphs under LogP

DOI10.1016/S0167-8191(00)00031-4zbMATH Open0945.68011OpenAlexW2113581482MaRDI QIDQ1575596FDOQ1575596

Authors: N. Delaunay 

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)00031-4

Recommendations

• scientific article; zbMATH DE number 1760098
• CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL
• On scheduling send-graphs and receive-graphs under the LogP-model
• List scheduling of parallel tasks
• Scheduling outtrees of height one in the LogP model

zbMATH Keywords

communicationlist schedulingLogP model

Mathematics Subject Classification ID

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

Cited In (3)

• Scheduling malleable tasks with precedence constraints
• Title not available (Why is that?)
• List scheduling with and without communication delays

This page was built for publication: List scheduling of general task graphs under LogP

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