1. “Self-Resetting Stage Logic” Presented by : Vishal Jain, ID: 200411029 Guided By: Prof. Anutosh Maitra

2. What is SRSL? • Synchronization approach • Data flow • clock less designs • Uses single rail encoding. • Why new thing? • SRSL is a simple, efficient and easy to implement therefore it is acceptable.

3. What has been implemented and what is going on in SRSL? >16 stage four bit linear pipe (April ,2004 by Abdel Ejnioui, University of Central Florida) > RAM cell design had been tested successfully > Trying to implement for larger network.

4. Contents: 1.Introduction 2. Basic Circuit – 1 Bit 3. Basic Circuit – Multi Bits 4. Pipeline : Linear 4-Stages 5. Nonlinear : Fork and Join 6. Analysis 7. SRSL in Multiagent Model

5. Evaluate phase Reset phase • Introduction • Self Resetting stage logic: • A pipeline stage resets itself before starting a new execution cycle. • Two Phases • Evaluation Phase : when it executes the instruction and output • is result of evaluation of its input • Reset Phase : When output is Null • Data flow

6. Every Long journey starts with Small Step 2. SRSL for ONE BIT

8. 1

9. 1

10. 1

11. 1

12. 1

13. 0 1

14. 0 0

15. 0 0

16. 1

17. One and one makes eleven 3. Extending SRSL for multi bits

19. Let us do some more interesting thing 4. Linear Pipelining with SRSL

20. T2 T1 Tk Principle of Linear Pipelining Let T be a task which can be partitioned Into k subtasks (aka stages)according to linear precedence Relation: T={T1,T2,…,Tk}; A subtask Tj can not start until {Ti  i<j} are Finished.This can be modeled with the linear precedence graph:

22. Can you help me if I am a pipeline with Fork and Join ? 5. Fork and Join operations in pipeline

23. Fork and Join of DATA streams: • Fork : • 2. Join : B A C D F E

26. 6. Analysis of Linear Pipeline

27. Notations: • d( En) = time of Execution phase of nth stage • d( Rn) = time of Reset phase of nth stage • Pn= time of Stage n • Observations because of Invert-And delay • d(En)=d(Rn)=Pn/2 • d(Rn-1) < d(Rn) • d(En-1) > d(En)

29. What we observe from graph?? We can’t go beyond a certain limit of cascading because evaluation reset phase time decreases and here comes limitation of SRSL. Therefore it is not Scalable in present scenario.

30. 7. How SRSL may be benificial for Multiagent Model?

31. Noval Idea: I suggest use this mechanism to implement Data Join in “Hierarchical Multiagent Model” and present possible advantages by using this model in hierarchical Multiagent Model: • The key ideas behind the SRMM are • 1. “Whenever Data is ready it is delivered to the higher level Agent. • Without any signaling protocol which saves time.” • “The Higher level agent always get latest data.” e c d b a

32. References: • G.Jung , V.Sudharajan and G.E. Sobelman “ A self resetting • 32-bit parallel adder”. • “Parallelism Scalability and Programmability” Kai Hwang • “Multistage Modeling” search results of Google.com • Lecture Notes , Prof. Anutosh Maitra

33. Thanking You