I have some problems understanding how queue registers is controlled (i.e. when to store new instruction bytes and when to wait)
I know that whenever two bytes on the top are empty, it gets new two instruction bytes ..
But how can it tell when the byte is empty or shifted down ??
some model (illustrating) architecture of queue registers would help me understanding the technical issues perfectly, I hope ..
thank you
- Badges
- Science topic
- Similar topics
- Design
- Architecture
Similar questions and discussions