Bus arbitration concept in ARM Architecture - Time & Space Complexity
Bus arbitration decides which device uses the shared bus at a time in ARM systems.
We want to understand how the time to grant bus access grows as more devices request it.
Analyze the time complexity of the following bus arbitration code snippet.
LOOP:
LDR R0, [REQUESTS] ; Load bus request signals
CMP R0, #0 ; Check if any request is active
BEQ LOOP ; If none, keep waiting
; Find highest priority request
MOV R1, #0 ; Index
MOV R2, #0 ; Selected device
CHECK:
TST R0, #(1 << R1) ; Test bit for device R1
BEQ NEXT
MOV R2, R1 ; Select this device
B DONE
NEXT:
ADD R1, R1, #1
CMP R1, #MAX_DEVICES
BLT CHECK
DONE:
; Grant bus to device in R2
This code waits for bus requests and selects the highest priority device to grant bus access.
Identify the loops, recursion, array traversals that repeat.
- Primary operation: Loop checking each device's request bit to find the highest priority.
- How many times: Up to the number of devices connected to the bus (MAX_DEVICES).
As the number of devices increases, the loop runs more times to check each request.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | About 10 checks |
| 100 | About 100 checks |
| 1000 | About 1000 checks |
Pattern observation: The number of operations grows directly with the number of devices.
Time Complexity: O(n)
This means the time to decide who gets the bus grows linearly with the number of devices requesting access.
[X] Wrong: "Bus arbitration time stays the same no matter how many devices request the bus."
[OK] Correct: Each device's request must be checked, so more devices mean more checks and longer arbitration time.
Understanding how bus arbitration scales helps you reason about hardware performance and system delays in real devices.
"What if the arbitration used a parallel hardware circuit instead of a loop? How would the time complexity change?"
Practice
Solution
Step 1: Understand bus arbitration role
Bus arbitration manages access to a shared communication path (bus) among multiple devices.Step 2: Identify main purpose
Its main goal is to prevent conflicts by deciding which device uses the bus at a given time.Final Answer:
To decide which device can use the shared bus at a time -> Option CQuick Check:
Bus arbitration controls bus access = A [OK]
- Confusing bus arbitration with processor speed control
- Thinking it stores data instead of managing access
- Assuming it encrypts data
Solution
Step 1: Identify signals in bus arbitration
Devices use signals to communicate their need to use the bus.Step 2: Match signal to request control
The 'Request' signal is sent by a device to ask for bus access.Final Answer:
Request signal -> Option AQuick Check:
Request signal asks for bus access = D [OK]
- Mixing up request and grant signals
- Thinking clock or reset signals control bus access
- Assuming grant signal requests access
Solution
Step 1: Understand round-robin arbitration order
Round-robin gives bus access in a fixed cyclic order among devices.Step 2: Determine next device after D1
After D1, the next device in order is D2.Final Answer:
D2 -> Option BQuick Check:
Round-robin cycles D1 -> D2 -> D3 = B [OK]
- Assuming same device keeps bus repeatedly
- Thinking bus stays idle between devices
- Confusing round-robin with priority arbitration
Solution
Step 1: Understand priority arbitration
Priority arbitration grants bus access to the device with the highest priority among requesters.Step 2: Compare requesting devices
D1 has the highest priority and requests the bus simultaneously with D3.Final Answer:
D1 -> Option AQuick Check:
Highest priority requester gets bus = D1 = C [OK]
- Choosing lower priority device when higher requests
- Assuming bus stays free if multiple requests
- Confusing priority with round-robin
Solution
Step 1: Understand combined arbitration method
The method uses priority to select devices but applies round-robin fairness among same priority devices.Step 2: Apply round-robin after immediate grant
Since D2 just had the bus, even if it requests again, the next device in round-robin order gets the bus to ensure fairness.Final Answer:
Next device in round-robin order after D2 -> Option DQuick Check:
Priority + round-robin fairness = next device after D2 = A [OK]
- Assuming same device gets bus repeatedly ignoring fairness
- Choosing lowest priority device without reason
- Thinking bus stays idle unnecessarily
Ready to prove it?
Pass the test and this pattern moves unknown
