1 / 18

Buffer Space Optimisation with Communication Mapping and Traffic Shaping for NoCs

Buffer Space Optimisation with Communication Mapping and Traffic Shaping for NoCs. Sorin Manolache, Petru Eles, Zebo Peng Link ö ping University, Sweden. Outline. System model Motivational example Problem formulation Solution outline Experimental results Conclusions. S 0,1. S 1,1.

damia
Télécharger la présentation

Buffer Space Optimisation with Communication Mapping and Traffic Shaping for NoCs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Buffer Space Optimisation with Communication Mapping and Traffic Shaping for NoCs Sorin Manolache, Petru Eles, Zebo Peng Linköping University, Sweden

  2. Outline • System model • Motivational example • Problem formulation • Solution outline • Experimental results • Conclusions

  3. S0,1 S1,1 S2,1 S3,1 P0,1 P1,1 P2,1 P3,1 t7 t2 t1 S0,0 S1,0 S2,0 S3,0 P0,0 P1,0 P2,0 P3,0 t8 t9 t10 t11 t5 t4 t3 t6 System Model

  4. S0,1 S1,1 S2,1 S3,1 P0,1 P1,1 P2,1 P3,1 t7 S0,0 S1,0 S2,0 S3,0 P0,0 P1,0 P2,0 P3,0 t8 t9 t10 t11 Motivational Example t2 t1 t5 t4 t3 t6

  5. Motivational Example P0,1 L0,1,E P1,1 L1,1,E L1,1,S L2,1,S P2,1 P2,0 L1,0,E P1,0 L0,0,E P0,0 L0,1,S L2,0,E P3,0 Time

  6. Buffer Space Minimisation • Scenario in which an application-specific NoC is built • There is freedom in deciding how much buffer memory to put at each switch  Minimisation of the total buffer space demand of the application

  7. Solution Techniques • Problem solved with the combination of two techniques: • Off-line mapping of data packets to network links • Setting the release time of each packet on the link (traffic shaping)

  8. S0,1 S1,1 S2,1 S3,1 P0,1 P1,1 P2,1 P3,1 t7 S0,0 S1,0 S2,0 S3,0 P0,0 P1,0 P2,0 P3,0 t8 t9 t10 t11 Communication Mapping t2 t1 t5 t4 t3 t6

  9. Communication Mapping P0,1 L0,1,E P1,1 L1,1,E L1,1,S L2,1,S P2,1 P2,0 L1,0,E P1,0 L0,0,E P0,0 L0,1,S L2,0,E P3,0 Time

  10. Traffic Shaping P0,1 L0,1,E P1,1 L1,1,E L1,1,S L2,1,S P2,1 P2,0 L1,0,E P1,0 L0,0,E P0,0 L0,1,S L2,0,E P3,0 Time

  11. Problem 1: Application-Specific NoCs • Scenario in which an application-specific NoC is built • Find a communication mapping and the packet release times of all packets and determine the amount of buffer memory at each switch such that • No deadline is missed and no buffer overflow occurs • The total amount of buffer memory is minimised • Message arrival probability is above a specified threshold given a link failure model

  12. Problem 2: Predefined NoC Platform • Scenario in which the application is implemented on an existing NoC with given buffer memory at each switch • Find a communication mapping and the packet release times of all packets such that • No deadline is missed and no buffer overflow occurs • Message arrival probability is above a specified threshold given a link failure model

  13. Communication mapping Response-time analysis Response-time analysis Buffer space analysis Buffer space analysis Traffic shaping Approach Overview

  14. Experimental Results

  15. Experimental Results

  16. Experimental Results

  17. Conclusions • It is important for a communication synthesis method to consider buffer space minimisation • Communication mapping and traffic shaping heuristic for buffer space minimisation under real-time constraints • Fast buffer space analysis

  18. Buffer Space Analysis 0 15 27.5 35 40 42.5 0 15 27.5 35 40 42.5

More Related