Search: onr:"swepub:oai:DiVA.org:kth-13035" >
Feasibility analysi...
Feasibility analysis of messages for on-chip networks using wormhole routing
-
- Lu, Zhonghai (author)
- KTH,Mikroelektronik och Informationsteknik, IMIT
-
- Jantsch, Axel (author)
- KTH,Mikroelektronik och Informationsteknik, IMIT
-
- Sander, Ingo (author)
- KTH,Mikroelektronik och Informationsteknik, IMIT
-
(creator_code:org_t)
- New York, New York, USA : IEEE conference proceedings, 2005
- 2005
- English.
-
In: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2. - New York, New York, USA : IEEE conference proceedings. ; , s. 960-964
- Related links:
-
https://urn.kb.se/re...
-
show more...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- 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.
Keyword
- TECHNOLOGY
- TEKNIKVETENSKAP
Publication and Content Type
- ref (subject category)
- kon (subject category)
To the university's database