You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, the load-store queue is quite limited in Snitch and since the addition of store response handling becomes easily full. The idea would be to compress back-to-back stores as we are not interested in the actual value but just that we have an outstanding store.
I think something like a compressable_fifo would be a good start where element of the same time pushed back-to-back could increment a counter instead of occupying an actual queue item. Critical paths need to be checked as well.
The text was updated successfully, but these errors were encountered:
* hw: Add HWPE MAC ctrl code
* hw: Add HWPE MAC reqrsp code
* hw: Add HWPE MAC top code
* bender: add HWPE mac files to bender list
* lint: Exclude HWPE MAC files from license checker
* hw: make sure the module name matches the fine name
* bender: change the file name of hwpe mac
* hw: rm the hwpe mac file with wrong filename
* bender: change the order of hwpe mac in bender list
* hw: edit comments
* hw: Clarify comments about the data addressing
---------
Co-authored-by: rgantonio <[email protected]>
Currently, the load-store queue is quite limited in Snitch and since the addition of store response handling becomes easily full. The idea would be to compress back-to-back stores as we are not interested in the actual value but just that we have an outstanding store.
I think something like a
compressable_fifo
would be a good start where element of the same time pushed back-to-back could increment a counter instead of occupying an actual queue item. Critical paths need to be checked as well.The text was updated successfully, but these errors were encountered: