This is the third part of a series of articles on VHDL arbiters.
In the first part, we talked about what a VHDL arbiter is.
In the second part, we saw the VHDL code for a fixed-priority VHDL arbiter.
When I talked about what a VHDL arbiter is, I gave the example of the single car we had at home, and how I had to decide who gets to use the car next Friday evening. In a typical situation, if both children ask for the car, the first thing they will account for is, who got the car the last time.
The fixed priority arbiter is the equivalent of always giving your car to the same child. It will, no doubts, create problems. If you don’t want to create problems, you will make a balanced assignment of the valued resource between the solicitors.
Continue reading “VHDL arbiter – part III” →