Task ordering and memory management problem for degree of parallelism estimation

DOI10.1007/978-3-642-22685-4_51zbMATH Open1353.68026OpenAlexW201703296MaRDI QIDQ3087985FDOQ3087985

Authors: Sergiu Carpov, Jacques Carlier, Dritan Nace, Renaud Sirdey 

Publication date: 17 August 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_51

Recommendations

• Scheduling Sequential Loops on Parallel Processors
• scientific article; zbMATH DE number 1884457
• scientific article; zbMATH DE number 1185605
• scientific article; zbMATH DE number 1830922
• Complexity of Task Graph Scheduling with Fixed Communication Capacity

zbMATH Keywords

task schedulingmemory managementparallel processor

Mathematics Subject Classification ID

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

This page was built for publication: Task ordering and memory management problem for degree of parallelism estimation

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