Feasibility analysis of messages for on-chip networks using wormhole routing
2005 (English)In: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, IEEE conference proceedings, 2005, 960-964 p.Conference paper (Refereed)
The feasibility of a message in a network concerns if its timing property can be satisfied without jeopardizing any messages already in the network to meet their timing properties. We present a novel feasibility analysis for real-time (RT) and non-realtime (NT) messages in wormhole-routed networks on chip. For RT messages, we formulate a contention tree that captures contentions in the network. For coexisting RT and NT messages, we propose a simple bandwidth partitioning method that allows us to analyze their feasibility independently.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2005. 960-964 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-13035ISI: 000245021700193ScopusID: 2-s2.0-70349787717OAI: oai:DiVA.org:kth-13035DiVA: diva2:320389
10th Asia and South Pacific Design Automation Conference. Shanghai, PEOPLES R CHINA. JAN 18-21, 2005
QC 20100525. QC 201602122010-05-252010-05-242016-02-12Bibliographically approved