1 / 30

Reduction in synchronisation in bundled data systems

Reduction in synchronisation in bundled data systems. Charlie Brej APT Group Manchester University. Outline. Asynchronous Circuits Early Output Counterflow Networks Anti-Tokens Conclusions. Asynchronous Latch. Ri. Ro. Latch. Ai. Ao. Req. Ack. Asynchronous Pipeline.

michaelh
Download Presentation

Reduction in synchronisation in bundled data 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. Reduction in synchronisation in bundled data systems Charlie Brej APT Group Manchester University ToBaCo '04

  2. Outline • Asynchronous Circuits • Early Output • Counterflow Networks • Anti-Tokens • Conclusions ToBaCo '04

  3. Asynchronous Latch Ri Ro Latch Ai Ao Req Ack ToBaCo '04

  4. Asynchronous Pipeline ToBaCo '04

  5. Pipeline merging ToBaCo '04

  6. Pipeline merging C ToBaCo '04

  7. Pipeline merging C 0 0 1 ToBaCo '04

  8. Early Output cases Average:80% ToBaCo '04

  9. Early Output Go! 0 0 ? ToBaCo '04

  10. Guarding Problem: • Inputs • Late • Unnecessary • Acknowledge before ready Solution: • Validity signal (Vo) Ri Ro Vo Latch Ao Ai ToBaCo '04

  11. Early Output with Guarding Go! 0 0 C 1 ToBaCo '04

  12. Counterflow Networks • Nodes fire when a threshold of neighbors have fired • No Inputs/Outputs, just Links • Neural network like operation ToBaCo '04

  13. Counterflow Networks ToBaCo '04

  14. Counterflow Networks ToBaCo '04

  15. Counterflow Networks ToBaCo '04

  16. Counterflow Networks ToBaCo '04

  17. Anti-Tokens • Reproduce the counterflow network behavior in the single-rail system. • Inputs allow early acknowledgements • Output latches can acknowledge early • Propagate early acknowledgements ToBaCo '04

  18. Anti-Token Generation Go! 0 0 C A ToBaCo '04

  19. Anti-Token Propagation Go! A A C A ToBaCo '04

  20. Token Pass T T T ToBaCo '04

  21. Anti-Token Pass A A A ToBaCo '04

  22. Token Anti-Token collision T ? A ToBaCo '04

  23. Token Anti-Token collision 2 T T A ToBaCo '04

  24. Dual-Purpose Signals • Arbiter free • Req: • Token Request • Acknowledge Anti-Token • Ack: • Request Anti-Token • Acknowledge Token Req Ack ToBaCo '04

  25. Standard ToBaCo '04

  26. Standard ToBaCo '04

  27. Early Output ToBaCo '04

  28. Anti-Tokens ToBaCo '04

  29. Anti-Tokens ToBaCo '04

  30. Conclusions • Early output easy on most blocks • Multiplexers • Bit-level pipelining • Counterflow • no arbitration • Increased performance • Mixed use of techniques • Fewer synchronisations ToBaCo '04

More Related