In reply to chr_sue:
In reply to abs:
What you are describing is the common scoreboard scenario. The UVM Library provides you the uvm_analysis_fifo to solve this issue.
Maybe my initial question was not clear enough, so I’ll elaborate. Let’s call the fifo on the output transactions the “output_fifo” and the fifo on the stimuli transactions the “input_fifo”.
For every transaction on the output_fifo of the DUT I have N transactions on the input_fifo. So now I will have one fifo full of N transactions and the other fifo with one transaction only.
In the scoreboard run_phase I pop the first transaction out of the “output_fifo” and how would I go about comparing with the transactions in the input_fifo? Do I pop one by one until I find one that matches? Since the matching is approximate, there might be more than one transaction matching, how do I proceed in telling which one is the match?
Hope now the scenario is more clear.