1 / 263

Part 2: Synchronous Elastic Systems

Part 2: Synchronous Elastic Systems. Jordi Cortadella and Mike Kishinevsky. 28th Int. Conf. on Application and Theory of Petri Nets and Other Models of Concurrency Siedlce, Poland, June 25, 2007. Universitat Politecnica de Catalunya Barcelona, Spain.

leisad
Télécharger la présentation

Part 2: Synchronous Elastic Systems

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. Part 2: Synchronous Elastic Systems Jordi Cortadella and Mike Kishinevsky 28th Int. Conf. on Application and Theory of Petri Nets and Other Models of Concurrency Siedlce, Poland, June 25, 2007 Universitat Politecnica de Catalunya Barcelona, Spain IntelStrategic CAD Labs Hillsboro, USA

  2. Synchronous elastic systems also called • Latency tolerant systems or • Latency insensitive systems • We use term “synchronous elastic” since better linked to asynchronous elastic

  3. Basics of elastic systems Early evaluation and performance analysis Optimization of elastic systems and their correctness Agenda of Part 2

  4. What and Why Intuition How to design elastic systems Converting synchronous system to elastic Micro-arch opportunities Marked Graph models Performance evaluation I

  5. Token (of data) Synchronous Stream of Data … 4 7 1 … Clock cycle 2 1 0

  6. Token Bubble (no data) Synchronous Elastic Stream … 4 7 1 … Clock cycle 2 1 0 … Clock cycle 5 4 3 2 1 0 … 1 7 4

  7. Synchronous Circuit Latency = 0 … … + 4 7 1 … 4 8 3 0 1 2

  8. Synchronous Elastic Circuit Latency = 0 … … + 4 7 1 … 4 8 3 0 1 2 … … 4 + 7 1 e … 3 4 8 0 1 2 Latency can vary

  9. Ordinary Synchronous System A C A C = D D B B Changing latencies changes behavior

  10. Synchronous Elastic (characteristic property) A C A C e e e e e = D D B B e e e e Changing latencies does NOT change behavior = time elasticity

  11. Why • Scalable • Modular (Plug & Play) • Better energy-delay trade-offs (design for typical case instead of worst case) • New micro-architectural opportunities in digital design • Not asynchronous: use existing design experience, CAD tools and flows

  12. Example of elastic behavior

  13. ALU 5 6 1 2 3 1 2 3 4 4

  14. ALU 5 6 1 2 3 1 2 3 4 4

  15. ALU 6 1 2 3 4 2 3 4 5 5

  16. ALU 1 2 3 4 5 3 4 5 6 6

  17. ALU 2 3 4 5 6 4 5 6 1 1

  18. ALU 3 4 5 6 1 5 6 1 2 2

  19. ALU 4 5 6 1 2 6 1 2 3 3

  20. ALU 5 6 1 2 3 1 2 3 4 4 ?

  21. ALU 1 2 3 4 4 3 2 6 5 ?

  22. Not valid ALU 1 2 3 4 4 3 2 6 5 5 Stop ! ? Join

  23. ALU 1 2 3 4 4 3 2 6 5 5 Not valid ? Stop !

  24. ALU 1 2 3 4 4 3 2 6 5 5 Not valid ? Lazy (stop) Stop !

  25. ALU 1 2 3 4 4 3 2 6 5 5 Not valid ? Lazy (stop) Stop !

  26. ALU 1 2 3 4 4 3 2 6 5 5 Not valid ? Lazy (stop) Stop !

  27. ALU 1 2 3 4 4 3 2 6 5 5 ? Lazy (stop)

  28. ALU 1 2 3 4 4 3 6 5 5 ? Lazy (stop)

  29. ALU 1 2 3 4 4 3 6 5 5 6 ? Stop

  30. ALU 1 2 3 4 4 3 6 5 5 6 ? Stop

  31. ALU 1 2 3 4 4 3 6 5 5 6 ?

  32. ALU 1 2 3 4 4 6 5 5 6 ?

  33. ALU 2 3 4 4 5 6 6 5 1 1 ?

  34. ALU 4 5 5 6 6 1 1 3 2 ?

  35. How to design elastic systemsWe show an example of the implementation: SELF = Synchronous Elastic Flow Others are possible

  36. Reminder: Memory elements. Transparent latches Q Q D D L H En En Active low: En = 1 (opaque): Q = prev(Q) En = 0 (transparent): Q = D Active high: En = 0 (opaque): Q = prev(Q) En = 1 (transparent): Q = D 36

  37. Reminder: Memory elements. Flip-flop Q D Q L H D FF CLK CLK CLK D Q 37

  38. Reminder: Clock cycle = two phases 0 delay abstraction = L H 0 delay abstraction 0 delay abstraction 38

  39. Elastic channel protocol not Valid Valid * Stop Retry Idle Sender Receiver Data Valid * not Stop Valid Transfer Stop

  40. Sender Receiver Elastic channel protocol * D D * C C C B * A Data Data 0 1 1 0 1 1 1 1 0 1 Valid Valid 0 0 1 0 0 1 1 0 0 0 Stop Stop Transfer Retry Idle

  41. Elastic buffer keeps data while stop is in flight Cannot be done withSingle Edge Flops without double pumping Can use latches inside Master-Slave W1R1 W2R1 W1R2 W2R2

  42. Communication channel sender receiver Data Data Long wires: slow transmission

  43. Data Pipelined communication sender receiver Data What if the sender does not always send valid data?

  44. The Valid bit sender receiver Data Data Valid Valid What if the receiver is not always ready ?

  45. sender receiver Data Data Valid Valid Stop Stop 0 0 0 0 0 The Stop bit

  46. sender receiver Data Data Valid Valid Stop Stop 0 0 0 1 1 The Stop bit

  47. sender receiver Data Data Valid Valid Stop Stop 0 0 1 1 1 The Stop bit

  48. sender receiver Data Data Valid Valid Stop Stop 1 1 1 1 1 The Stop bit Back-pressure

  49. sender receiver Data Data Valid Valid Stop Stop 0 0 0 0 1 The Stop bit Long combinational path

  50. Cyclic structures Data Valid Stop Combinational cycle One can build circuits with combinational cycles (constructive cycles by Berry), but synthesis and timing tools do not like them

More Related