Two-level scheduling

Fixed-priority pre-emptive scheduling

Scheduling (production processes)

Mathematics

Schedule

Dynamic priority scheduling

Operating system

Algorithm

Distributed computing

Mathematical optimization

Rate-monotonic scheduling

Parallel computing

Embedded system

Round-robin scheduling

Computer science

Computation

High-level synthesis

Real-time computing

Fair-share scheduling

Earliest deadline first scheduling

Field-programmable gate array

A central task in high-level synthesis is scheduling: the allocation of operations to clock cycles. The classic approach to scheduling is static, in which each operation is mapped to a clock cycle at compile-time, but recent years have seen the emergence of dynamic scheduling, in which an operation's clock cycle is only determined at run-time. Both approaches have their merits: static scheduling can lead to simpler circuitry and more resource sharing, while dynamic scheduling can lead to faster hardware when the computation has non-trivial control flow.

Combining Dynamic &amp; Static Scheduling in High-level Synthesis

Combining Dynamic &amp; Static Scheduling in High-level Synthesis

Combining Dynamic & Static Scheduling in High-level Synthesis