| 摘要 |
As status for every cash memory at a snoop processing time, "BUSY" and "HIT & BUSY" are provided. The "BUSY" shows that data subjected to a memory access request compete with data subjected to a prior memory access request on the same cash line. The "HIT & BUSY" shows that there is not such competition but the data subjected to the memory access request exist in the cash memory and resources for transferring data from the cash memory are exhausted. When all the status is merged and a final status is determined, the "HIT & BUSY" is lower in priority than "HIT" showing that a data transfer is possible from the cash memory. Thus, even when a data transfer is impossible from a certain cash memory but possible from other cash memories, the data transfer is made possible without re-trying the snoop processing. |
