Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times

DOI10.1016/j.mcm.2007.05.009zbMath1144.90374OpenAlexW2063139770WikidataQ126223726 ScholiaQ126223726MaRDI QIDQ947867

Zdeněk Hanzálek, Přemysl Šucha

Publication date: 8 October 2008

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2007.05.009

zbMATH Keywords

integer linear programminghigh-level synthesisFPGAcyclic schedulingchangeover times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (1)

A cyclic scheduling problem with an undetermined number of parallel identical processors

Uses Software

• GLPK
• Handel-C

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of a cyclic scheduling problem with identical machines and precedence constraints
• List schedules for cyclic scheduling
• A study of the cyclic scheduling problem on parallel processors
• On Graham's bound for cyclic scheduling
• OPTIMAL SOFTWARE PIPELINING UNDER RESOURCE CONSTRAINTS

This page was built for publication: Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times