I believe (based on multiple patents) that at least some of the scheduler queues are paired, so that if one queue can find no runnable instructions, it will issue the second-choice runnable instruction from the paired queue. I think we agree on the basic point, but I find his language of "coalesced" retirement incomprehensible (and maybe he thinks the same regarding my language!) We have different theories of how the ROB is laid out. It is about the best you can find, but Dougall and I differ on a few points: Click to expand.This is by Dougall Johnson and comes from
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |