| 摘要 |
The invention relates to resolving data conflicts among a plurality of nodes. The nodes are made up of a plurality of peer nodes (with cache memory) and a home node (without cache memory). This home node retires a conflict message and removes the conflicting node from a conflict chain when a set of conditions have been met. For instance, the home node must have received all of the acknowledgement messages from the affected nodes, and a transfer or Forward message. Also, a transfer message must have been sent, or the conflicting node must have been the last in the chain. Further, the invention is used for cache coherency among the plurality of nodes. |
