33
Lesson 12: Bus Arbitration Chapter 11: Input/Output Organisation

Bus Arbitration - Devi Ahilya Vishwavidyalaya

  • Upload
    others

  • View
    6

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Lesson 12:Bus Arbitration

Chapter 11: Input/Output Organisation

Page 2: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

2

Objective• Be familiar with bus arbitration hardware, daisy chaining, and polling methods of a bus controller

Page 3: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

3

One processor or controller functioning as bus master

Page 4: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

4

A number of DMA or other controllers or processors

• Trying to get access to a bus at the same time, but access can be given to only one of these

• System buses shared between the controller and processor

Page 5: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

5

A number of DMA or other controllers or processors

Page 6: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

6

Only one processor or controller functioning as bus master

• Only one processor or controller can be bus master

• The bus master─ the controller that has access to a bus at an instance

• Any one controller or processor can be the bus master at the given instance (s)

Page 7: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

7

Bus arbitration process

• Refers to a process by which the current bus master accesses and then leaves the control of the bus and passes it to another bus-requesting processor unit

Page 8: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

8

Three bus arbitration processes

1. Daisy Chain 2. Independent Bus Requests and Grant 3. Polling

Page 9: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

9

Daisy Chaining according to priority

Page 10: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

10

Daisy Chain Method

• A method for a centralized bus arbitration process

• The bus control passes from one bus master to the next one, then to the next and so on

• Bus control passes from unit U0 to U1, then to U2, then U3, and so on

• U0 has highest priority, U1 next, and so on

Page 11: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

11

Daisy chaining method

1

2 3

4

5

Page 12: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

12

Timing diagram in daisy chaining method method

Page 13: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

13

Step 1

• Bus Grant BGri — This signal means that a unit has been granted bus access and can take control

• Bus grant signal passes from ith unit to (i +1)th

unit in daisy chaining when ith unit does not need bus control

• The arbitrator issues only BGr0

Page 14: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

14

Step 2

• Bus Request BRqi — this signal means that i-thunit has requested for the grant of the bus access and requests to take control of the bus

Page 15: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

15

Step 3

• Busy─ this signal is to and from a bus master to enables all other units with the bus to note that presently bus access is not possible as one of the units is busy using the bus or has been granted control over the bus

• The unit, which accepts the BGr, issues the Busy

Page 16: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

16

Independent Bus-Request and Grant Method

Page 17: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

17

Bus independent requests and grants method

• The bus control passes from one bus master to another only through the centralized bus controller

• Assume n units can be granted bus master status by a centralized processor as bus controller after listening to its request

Page 18: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

18

Independent request method

• The centralized controller listens to requests of each device individually and grant access to the bus

• If number of requests pending, then grant by a priority resolution algorithm which resolves the priority issue

Page 19: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

19

Bus control passing from a bus master to another only grant of bus on an independent request

Page 20: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

20

Timing diagram in independent bus request and grant method

Page 21: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

21

Step 1

• Bus Request BRqi for i = 0 to n – 1• BRqi— this signal means that ith unit has

requested for the grant of the bus access and requests to take control of the bus

Page 22: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

22

Step 2

• Bus Grant BGri for i = 0 to n – 1• BGri signal means that ith unit has been granted

bus access and can take control• Bus grant signal passes to any ith unit from the

centralized processor only after the unit sends ith BRqi

Page 23: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

23

Step 3

• Busy─ this signal is from a bus master to enable all other units with the bus to note that presently bus access is not possible as one of the units is busy using the bus or has been granted control over the bus

Page 24: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

24

Polling Method

Page 25: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

25

Bus polling method

• The bus control passes from one processor (bus controller) to another only through the centralized bus controller, but only when the controller sends poll count bits, whichcorrespond to the unit number

• Assume n units can be granted bus master status by a centralized processor

Page 26: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

26

Bus polling method

Page 27: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

27

Step 1

• Bus Poll Count BPC (on three lines for a Uiwhere i = 0 to n – 1 or n = 8 )

• The count = c means that (2c – 1)th unit being polled for the grant of bus access and can take control from the processor

• Bus count lines connect to each unit from the centralized processor

Page 28: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

28

Step 2

• Bus Request BRqi for i = 0 to n – 1• This signal means that the ith unit has accepted

the grant of the bus available access and requests to take control of the bus

Page 29: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

29

Step 3

• Busy─ this signal is from a bus master to enable all other units with the bus to note that presently bus access is not possible as one of the units is busy in using the bus or has been granted control over the bus

Page 30: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

30

Summary

Page 31: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

31

We learnt

• Bus arbitration hardware three methods, daisy chaining, and polling methods of a bus controller

• Daisy chaining, the centralized controller always sending bus control to highest priority, which passes it to next if bus access not required

• Independent request method, the centralized controller listens to requests of each device individually and grant access to the bus on resolving its priority

Page 32: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

32

We learnt

• Polling methods method, the centralized controller does the polling of the devices and grant access to that bus which requests it on receiving the poll count

Page 33: Bus Arbitration - Devi Ahilya Vishwavidyalaya

Schaum’s Outline of Theory and Problems of Computer ArchitectureCopyright © The McGraw-Hill Companies Inc. Indian Special Edition 2009

33

End of Lesson 12 on Bus Arbitration