@inproceedings {189, title = {Bounding Buffer Space Requirements for Real-Time Priority-Aware Networks}, booktitle = {Proceedings of the Asia South Pacific Design Automation Conference (ASPDAC)}, year = {2014}, note = {

(Best Paper Candidate)

}, month = {January}, address = {SunTec, Singapore}, abstract = {

One implementation alternative for network interconnects in modern chip-multiprocessor systems is priority-aware arbitration networks. To enable the deployment of real-time applications to priority-aware networks, recent research proposes worst-case latency (WCL) analyses for such networks. Buffer space requirements in priority-aware networks, however, are seldom addressed. In this work, we bound the buffer space required for valid WCL analyses and consequently optimize router design for application specifications by computing the required buffer space at each virtual channel in priority-aware routers. In addition to the obvious advantage of bounding buffer space while providing valid WCL bounds, buffer space reduction decreases chip area and saves energy in priority-aware networks. Our experiments show that the proposed buffer space computation reduces the number of unfeasible implementations by 42\% compared to an existing buffer space analysis technique. It also reduces the required buffer space in priority-aware routers by up to 79\%.

}, author = {Hany Kashif and Hiren Patel} }