UPGRADE YOUR BROWSER

We have detected your current browser version is not the latest one. Xilinx.com uses the latest web technologies to bring you the best online experience possible. Please upgrade to a Xilinx.com supported browser:Chrome, Firefox, Internet Explorer 11, Safari. Thank you!

cancel
Showing results for 
Search instead for 
Did you mean: 
Highlighted
Visitor igorplis
Visitor
108 Views
Registered: ‎05-31-2019

Round-robin algorithm AXI4-Stream Switch

Hello,

I'm studying AXI4 switch functionality and I have some questions about round-robin algorithm.

Does priority depend from age of pending or not? For example, I have 4 Slaves, 1 Master and number of transfers = 1 (It is the same as time quantum). Slave0 sends request to  master at time 0. Then  Slave0's request fall, Slave1 and Slave4 send request at time 1. And then Slave3 sends request at time 2. What is happenning in time 2? Who will get grant? Slave3 as it has most priority after Slave2 or Slave4 as it has most age of pending?

Explain me what is difference between round-robin and true round-robin algorithms in details, please.

0 Kudos