1. Spring 2006 1 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Advanced Computer Architecture Lecture 24 Eight-node distributed computer Ring router design

2. Spring 2006 2 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Distributed computer No global or shared memory Interconnect P M... P M P M

3. Spring 2006 3 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering System schematic Node

4. Spring 2006 4 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Ring router block diagram In Out D In I/F Out I/F CPU I/F Latch Controller LatchDriver

5. Spring 2006 5 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Ring router schematic (ROUTER.CKT) input buffer write buffer

6. Spring 2006 6 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Router controller schematic 4 Inputs 9 Outputs FSM contains 4 inputs and 9 outputs

7. Spring 2006 7 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Simplified state diagram 0 Write mode Read mode Pass mode Reset WReqRReq IReq Hint: each mode requires 4 states

8. Spring 2006 8 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering RTRFSM state diagram 0000 dl e g kc hf ijab Reset WReq RReq IReq WReq RReq IReq OAck IReq OAck WBClk WBE OReq WAck IBClk IBE RBE RAck OReq IBClk IBE OReq IAck Reset IAck WBE OReq WReq IBE RBE RReq IReq IBE

9. Spring 2006 9 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering PSRBEWBEWBClkIBEIBClkWAckRAckOReqIAck a b c d e f g h i j k l Find the output table?

10. Spring 2006 10 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering FSM timing: write

11. Spring 2006 11 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering FSM timing: read

12. Spring 2006 12 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering FSM timing: pass

13. Spring 2006 13 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Eight-node example 0 4 6 1 3 7 5 2 Write Pass Read

14. Spring 2006 14 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering System timing

15. Spring 2006 15 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Message format Header: routing and control information Payload: data Trailer: error checking code (ECC) Header PayloadTrailer time

16. Spring 2006 16 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Unidirectional ring router Ring Router IReq IAck In OReq OAck Out RReq WReq RAck WAck D Link inputLink output Processor

17. Spring 2006 17 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for DMA interface?

18. Spring 2006 18 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for header?

19. Spring 2006 19 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for fixed length message?

20. Spring 2006 20 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for trailer?

21. Spring 2006 21 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for interference?

22. Spring 2006 22 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering

23. Spring 2006 23 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering PSRBEWBEWBClkIBEIBClkWAckRAckOReqIAck a111 b10111 c1011 d1111 e111 f111 g0101 h01011 i111 j11011 k1101 l1111 Find the output table?

24. Spring 2006 24 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for DMA interface? CPU writes a word count CPU writes a memory address CPU writes a start command CPU does other useful work DMA responds with interrupt CPU acknowledges interrupt CPU processes message

25. Spring 2006 25 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for header? Router looks at first byte If destination address is to CPU, then routes data to processor port (buffer) If address is not to CPU, then passes data to correct link based on destination address

26. Spring 2006 26 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for fixed length message? Header byte resets counter Each new byte processed decrements counter When counter zero, message complete

27. Spring 2006 27 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for trailer? Each new data byte added to checksum calculation Calculated checksum compared to message checksum, error results in CPU interrupt

28. Spring 2006 28 EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Changes for interference? Design must support all possible concurrency modes Router checks for interference Possible responses –Block a message (deadlock possible), requires arbitration algorithm –Time multiplex (n-way) the link