A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF

From MaRDI portal
Publication:779440

DOI10.1007/S11241-018-9319-6zbMATH Open1436.68066OpenAlexW2898240133WikidataQ129024134 ScholiaQ129024134MaRDI QIDQ779440FDOQ779440


Authors: Mauro Leoncini, Manuela Montangero, Paolo Valente Edit this on Wikidata


Publication date: 13 July 2020

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-018-9319-6




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF

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