High-Performance Embedded Computing

428 Chapter 7 Hardware and Software Co-design

This graph helps identify loops that compete. Two loops that have different

first-level predecessors do not conflict in the trace and could be put into different

clusters. Loops that share a common predecessor may compete with each other

and are preferentially placed in the same cluster. Loops are clustered based on a

bottom-up walkthrough of the loop-procedure hierarchy graph, with the size of

each cluster limited by a parameter based on the size of the FPGA.

Even after we verify the hardware and components of a system independently,

we need to make sure that the components work together properly. Because ...