ON DYNAMIC TASK SCHEDULING FOR FPGA-BASED SYSTEMS

DOI10.1142/S0129054101000709zbMath1319.68014MaRDI QIDQ5249284

Oliver Diessel, Hossam ElGindy

Publication date: 30 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

FPGAdynamic allocationtask schedulingdynamic reconfigurationscheduling heuristicpartitionable arrayscheduling complexitytask rearrangement

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
• A 2.5 times optimal algorithm for packing in two dimensions
• Efficient processor allocation strategies for mesh-connected parallel computers

This page was built for publication: ON DYNAMIC TASK SCHEDULING FOR FPGA-BASED SYSTEMS