On dynamic task scheduling for FPGA-based systems
From MaRDI portal
dynamic allocationdynamic reconfigurationFPGApartitionable arrayscheduling complexityscheduling heuristictask rearrangementtask scheduling
Mathematical problems of computer architecture (68M07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic scheduling theory in operations research (90B35)
Recommendations
- An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.
- Optimization of dynamic hardware reconfigurations
- scientific article; zbMATH DE number 1941082
- An efficient list scheduling algorithm for time placement problem
- Task scheduling in a finite-resource, reconfigurable hardware/software codesign environment
Cites work
Cited in
(8)- An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.
- An efficient list scheduling algorithm for time placement problem
- Task scheduling in a finite-resource, reconfigurable hardware/software codesign environment
- scientific article; zbMATH DE number 1941082 (Why is no real title available?)
- scientific article; zbMATH DE number 1941132 (Why is no real title available?)
- scientific article; zbMATH DE number 1844675 (Why is no real title available?)
- Finding an optimal set of breakpoint locations in a control flow graph
- Optimization of dynamic hardware reconfigurations
This page was built for publication: On dynamic task scheduling for FPGA-based systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249284)