Verifying worst-case completion times for reconfigurable hardware modules using proof-carrying hardware.
Tobias WiersemaMarco PlatznerPublished in: ReCoSoC (2016)
Keyphrases
- reconfigurable hardware
- worst case
- completion times
- low cost
- absolute deviation
- functional units
- hardware software
- single machine
- hardware implementation
- single machine scheduling problem
- processing times
- scheduling problem
- field programmable gate array
- hardware and software
- weighted sum
- evolvable hardware
- image processing
- fine grain
- upper bound
- np hard
- lower bound
- processing elements
- embedded systems
- neural network
- computer systems
- design methodology
- data acquisition
- evolutionary algorithm
- approximation algorithms
- queue length
- signal processing
- functional modules
- resource allocation
- search algorithm