Static Scheduling of Periodic Hardware Tasks with Precedence and Deadline Constraints on Reconfigurable Hardware Devices

Table 1

Optimization parameters and techniques for scheduling works.

References	Makespan/Speedup/Parallel efficiency	Resource efficiency	Configuration overhead	Techniques
[2]	x		x	Prefetch/replace/reuse of reconfigurations
[3]	x			Graph unfolding/genetic algorithm/earliest start time heuristic
[4]	x			Timed automaton model/shortest path
[5]	x		x	(1) ILP/reuse
				(2) NAPOLEAN/ALAP/prefetch/reuse/antifragmentation
[6]	x			ILP/loop level task partitioning/task transformation (loop fusion + loop splitting)/task mapping and scheduling (task merging on batches + batch replication)/data mapping
[7]	x			(1) Graph decyclification (DFS + shortest critical path)/CP-MISF
				(2) Graph unfolding/genetic algorithm
[1]	x			Chaining/task selection first heuristic/critical path/edge width/communication latencies
[8]	x	x	x	Dynamic programming algorithm/FPGA total configuration
[9]	x	x		Orthogonal packing problem/packing classes
[10]	x		x	Prefetch/local optimization/reuse
[11]	x			Critical path heuristic/Branch and Bound