| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20260302 Slide.07
[Big Slide]
[YouTube] |
Oral Presentation |
|
|
Here is the MI state machine that drives our logic. The transitions are driven by comparing the Cache Occupancy ($n$) against the Target Buffer Size ($m$). The system smoothly transitions between Send, Store, Multipath, and Backpressure states. This ensures that we only utilize the secondary path when the cache delay perfectly compensates for the path delay difference, or we signal for help when resources are exhausted. | |
| [Go to Next Slide] |