A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning
From MaRDI portal
Publication:1268800
DOI10.1006/JPDC.1997.1416zbMATH Open0909.68015OpenAlexW2016818801MaRDI QIDQ1268800
Author name not available (Why is that?)
Publication date: 22 March 1999
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.1997.1416
No records found.
No records found.
This page was built for publication: A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268800)
