Bruno Bodin
Research Interests
Make your next move.
Prepare your application
Review drafts before you send them.
Explore related searches
Articles (2)
The design of time-critical embedded systems often requires static models of computation such as cyclo-static dataflow. These models enable performance guarantees, execution correctness, and optimized memory usage. Nonetheless, determining optimal buffer sizing of dataflow applications remains difficult: existing methods offer either approximate solutions or fail to provide solutions for complex instances. We propose a throughput-buffering trade-off exploration that uses K-periodic scheduling to direct a design-space exploration—providing optimal solutions while significantly reducing the search space compared to existing methodologies. We compare this strategy against previous approaches and demonstrate search-space reductions over two benchmark suites, resulting in significant improvements in computation times while retaining optimal results.
Year:
2022
Year:
2021
Collaborators (1)
Alix Munier Kordon
Université Paris-Saclay
Make your next move.
Prepare your application
Review drafts before you send them.