Speculative distributed conflict resolution for a cache coherence protocol

摘要

A method comprising the steps of: sending a request (1st PRIL) of a copy of a data block from a first peer node (210) of a multi-node system (200) to all other nodes in the multi-node system (200) (210 , 220, 230, 240), the system (200) including a home node (240) for the requested data block and a plurality of peer nodes (210, 220, 230), each peer node capable of storing a copy of the requested data block; Receiving a request (1.1 PRIL) of a copy of a data block from a second peer node (220) at the first peer node (210); determining if there is a conflict at the first peer node (210) and conflicting if the received request (1.1 PRIL) and the sent request (1st PRIL) request the same data block; if a conflict is determined, sending a first message (CNCL; READ) from the first peer node (210) the home node (240) indicating that the Conflict exists and whether a copy of the data block requested by the first peer node (210) has been received at the first peer node (210), the second peer node (220) sending a second message (READ) to the home node indicating that the conflict is; receiving a third message (XFER, DATA, XFER) from the home node (240) at the first node (210); the second peer node receiving a WAIT message from the home node; andsending the received copy of the data block from the first peer node (210) to the second peer node (220) in response to the received third message from the home node (240).