Skip to content
DenseChip
Learn
PracticeCode labInterview

DenseChip

Navigate

Menu

LearnPracticeCode labInterview

Tools

All toolsSV editorCode repoResume
DenseChip

Practice, courses, and chip-design tools in one focused workspace.

LearnPracticeCode labInterviewToolsLearning paths

© 2026 DenseChip

AboutContactPrivacyTerms
Skip to lesson

Course contents

  • How to Use This Course
  • Reading Paths
  • Concept Map
  • How to Read the Diagrams
  • Part 0: What Is a Protocol?10
  • Part 1: Timing and Clocking11
  • Part 2: Encoding and Framing12
  • Part 3: Handshakes13
  • Part 4: Flow Control17
  • Part 5: Transactions19
  • Part 6: Concurrency and Performance17
    • Latency, Throughput and Bandwidth
    • Little's Law
    • Outstanding Transactions
    • Tags and IDs
    • In-Order or Out-of-Order
    • Reorder Buffers
    • Interleaving
    • Split Completions
    • Protocol Efficiency
    • Peak and Sustained Bandwidth
    • Queueing Intuition
    • Tail Latency
    • Buffers That Hide Latency
    • Virtual Output Queues
    • Performance Modelling
    • Protocols Compared: Concurrency and Performance
    • Drills: Concurrency and Performance
  • Part 7: Ordering13
  • Part 8: Sharing and Arbitration12
  • Part 9: Deadlock and Liveness13
  • Part 10: Reliability and Recovery20
  • Part 11: Bring-Up and Link Management10
  • Part 12: Power8
  • Part 13: Shared State and Coherence9
  • Part 14: Security and Isolation7
  • Part 15: Specifying and Verifying11
  • Part 16: Protocols Dissected17
  • Part 17: Capstones5
  • Part 18: Interview Preparation6
Loading lesson

‹Part 6: Concurrency and Performance
  1. Topics
  2. First Principles of Hardware Protocols
  3. Part 6: Concurrency and Performance
  4. Protocols Compared: Concurrency and Performance

Part 6 · Concurrency and Performance · All levels

Protocols Compared: Concurrency and Performance

How APB, AXI, PCI Express and DCLink handle concurrency: outstanding requests, labels, completion order, interleaving, split completions and per-packet overhead.

On this page

    Read across for one protocol; read down to see how each answers "how many requests can be in flight, and in what order do they come back?"

    Concurrency, side by side

    APB

    AXI4

    PCI Express

    DCLink

    Outstanding requests

    One

    Many; limit set by each requester and target

    Many non-posted requests

    Up to 4 (step 5)

    Label on responses

    None needed

    ID on every channel

    Tag plus requester ID

    2-bit tag

    Completion order

    In order (one at a time)

    Same ID in order; different IDs any order

    Different requests any order; pieces of one read in address order

    Any order, matched by tag

    Interleaving

    —

    Read data of different IDs may interleave; write data may not (removed in AXI4)

    Whole packets; never split across others

    —

    One request, several responses

    No

    One burst returns many beats, RLAST on the last

    Reads above the maximum payload split at completion boundaries

    One completion per request

    Per-transfer overhead

    Setup and access phases

    Address handshake per burst

    20–24 bytes per packet plus encoding

    One header flit per request

    What the table shows

    • Concurrency needs labels: every protocol that allows many outstanding requests also tags responses.

    • Ordering is kept only where needed: per ID in AXI, per request in PCIe.

    • Per-transfer overhead drives packet and burst sizes: the larger the fixed cost, the more a protocol rewards long transfers (lesson 6.9).

    Where each idea is explained

    • 6.2 Little's Law

    • 6.3 Outstanding Transactions

    • 6.4 Tags and IDs

    • 6.5 In-Order or Out-of-Order

    • 6.7 Interleaving

    • 6.8 Split Completions

    • 6.9 Protocol Efficiency

    Tip

    For any interface, compute outstanding requests needed = rate × worst round trip, and compare it with its tags, response buffers and the target's queue. The smallest is its real throughput limit.

    Keep going

    Next: Drills: Concurrency and Performance. Interview questions, a whiteboard exercise and a ten-question checkpoint for Part 6.

    Related topics

    • Part 6 overview: Concurrency and Performance

    • Course hub

    Previous

    102 / 234

    Next: Drills: Concurrency and Performance

    Up next

    Up nextDrills: Concurrency and Performance

    Sign in to save progress

    Practice this lessonReport an error

    See also

    • Latency, Throughput and Bandwidth
    • Little's Law
    • Outstanding Transactions