| 1. |
- Andreasson, Daniel, et al.
(författare)
-
Improving BE traffic QoS using GT slack in NoC Systems
- 2005
-
Ingår i: Proceedings of 23th IEEE Norchip Conference, 21 - 22 Nov, Oulu, Finland.
-
Konferensbidrag (refereegranskat)abstract
- Recently, network on chip (NoC) architectures are beingproposed for implementing multi-core systems for realtimemulti-media applications. The communicationtraffic of those systems will be a mix of guaranteedthroughput (GT) and best effort (BE) traffic. GT trafficnot only lead to under-utilization of communication linksand routers, but also leads to degradation of QoSparameters for BE traffic. We propose a dynamic routingscheme for reducing jitter in the latency of BE trafficaffected by the GT traffic. Our results from modeling andsimulation indicate that a significant improvement injitter can be achieved.
|
|
| 2. |
- Andreasson, Daniel, et al.
(författare)
-
On improving Best-Effort throughput by better utilization of Guaranteed-Throughput channels in an on-chip communication system
- 2004
-
Ingår i: Proceedings of the NORCHIP 2004 conference, Oslo.
-
Konferensbidrag (refereegranskat)abstract
- It is possible to concurrently run multipleapplications on IP-core based SoC built using Networkon Chip (NoC) paradigm. Some applications requirepredictable and guaranteed on-chip communicationperformance. In this paper we propose a new approachfor using underutilized reservation of guaranteedthroughput (GT) traffic to improve the performance ofbest effort (BE) traffic. We have modeled our scheme fora mesh topology NoC on a simulation platform. Theresults show that the proposed scheme leads tosignificant improvement in BE performance.
|
|
| 3. |
- Andreasson, Daniel, et al.
(författare)
-
Slack-Time Aware Routing in NoC Systems
- 2005
-
Ingår i: Proceedings of International Symposium of Circuits and Systems, May 23-26, Kobe, Japan.
-
Konferensbidrag (refereegranskat)abstract
- Efficient routing schemes are essential if Network onChip (NoC) architectures are to be used for implementingmulti-core systems for real-time multi-media applications.These systems will be characterized by internal communicationtraffic which is a mix of traffic requiring guaranteedthroughput (GT) and other traffic requiring some other QoSproperties like latency and less packet drops. Communicationresources are generally reserved for providing GTperformance. In this paper we propose a dynamic scheme forimproving packet drop probability of other traffic byintelligently utilizing the under-utilized reservedcommunication resources of GT traffic. We demonstrate theeffectiveness of our scheme by simulation.
|
|
| 4. |
|
|
| 5. |
- Badri, Shabanam, et al.
(författare)
-
Junction Based Routing : A Scalable Technique To Support Source Routing in Large NoC Platforms
- 2012
-
Ingår i: Proceedings of Network on Chip Architectures 2012, ACM Digital Library. - New York, NY, USA : ACM Digital Library. - 9781450315401 ; , s. 45-50
-
Konferensbidrag (refereegranskat)abstract
- To support communication among hundreds of cores on a chip, on-chip communication must be well organized. In the embedded systems using such a chip, the communication patterns can be profiled off-line and routing can be well planned. Source routing has been shown to be suitable in such contexts. However, source routing has one serious drawback of overhead for storing the path information in header of every packet. This disadvantage becomes worse as the size of the network grows. In this paper we propose a technique, called Junction Based Routing (JBR), to remove this limitation. In the proposed technique, path information for only a few hops is stored in the packet header.With this information, either the packet reaches the destination, or reaches a junction from where the path information for on-ward path is picked up. There are many interesting issues related to this approach. We discuss and solve two important issues related to JBR, namely, the required number of junctions and their positions and path computation for efficient deadlock-free routing. A simulator has been developed to evaluate the performance of JBR and compare it with simple source routing. We observe that JBR has slightly worse performance as compared to pure source routing for packets with large payload. But JBR has potential of higher performance for packets with small payloads.
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
|
|
| 10. |
|
|
