A distributed computation system comprising a plurality of computation units and at least one shared memory shared between said computation units, also comprising at least one hardware module for detecting conflicts of access (INSP) of said computation units to said shared memory; characterised in that said or each said hardware module for detecting conflicts comprises: - at least one first hardware Bloom filter for temporarily storing a first probabilistic data structure, indicative of at least one address of said shared memory for which an access request has been received; - at least one second hardware Bloom filter, of the counting type, for storing a second probabilistic data structure, indicative of all the addresses of said shared memory involved in all the transactions already in progress; - at least one hash function module for addressing said first and second Bloom filters; and - a logic circuit (CMP, CTRI) configured to: - receive a message indicative of a request for access, by one said computation unit, at at least one address of said shared memory; update the first probabilistic data structure stored in the first hardware Bloom filter for it to be indicative of said address; determine, from the probabilistic data structures stored in said first and second Bloom filters, whether said address is already involved in a current transaction; generate and transmit to said computation unit a message indicating presence or absence of access conflicts; and to - receive at least one message indicative of or confirming a reservation or a release of at least one said address of said shared memory, and update said second probabilistic data structure stored in the second hardware Bloom filter for the reserved addresses and the released addresses to be considered, respectively, as being/not being involved in a current transaction. - at least one first hardware Bloom filter for temporarily storing a first probabilistic data structure, indicative of at least one address of said shared memory for which an access request has been received; - at least one second hardware Bloom filter, of the counting type, for storing a second probabilistic data structure, indicative of all the addresses of said shared memory involved in all the transactions already in progress; - at least one hash function module for addressing said first and second Bloom filters; and - a logic circuit (CMP, CTRI) configured to: - receive a message indicative of a request for access, by one said computation unit, at at least one address of said shared memory; update the first probabilistic data structure stored in the first hardware Bloom filter for it to be indicative of said address; determine, from the probabilistic data structures stored in said first and second Bloom filters, whether said address is already involved in a current transaction; generate and transmit to said computation unit a message indicating presence or absence of access conflicts; and to - receive at least one message indicative of or confirming a reservation or a release of at least one said address of said shared memory, and update said second probabilistic data structure stored in the second hardware Bloom filter for the reserved addresses and the released addresses to be considered, respectively, as being/not being involved in a current transaction.