Scheduling outtrees of height one in the LogP model

DOI10.1016/S0167-8191(00)00029-6zbMATH Open0945.68014MaRDI QIDQ1575592

Jacques Verriet

Publication date: 21 August 2000

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

communication overheadmulti-processor schedulingLogP modelfork graphscommunication latency

Mathematics Subject Classification ID

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

This page was built for publication: Scheduling outtrees of height one in the LogP model

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