Heapsort

Quicksort

Merge sort

Radix sort

The goto part of both tables may be different.

The shift entries are identical in both the tables.

The reduce entries in the tables may be different.

The error entries in the tables may be different.

Error detection

Error correction

Synchronization

Slowing down the communication

$$\left( {\forall \,x} \right){\rm P}\left( x \right) \vee \left( {\forall \,x} \right)Q\left( x \right) \to \left( {\forall \,x} \right)$$
$$\left\{ {{\rm P}\left( x \right) \vee Q\left( x \right)} \right\}$$

$$\left( {\exists \,x} \right){\rm P}\left( x \right) \wedge \left( {\exists \,x} \right)Q\left( x \right) \to \left( {\exists \,x} \right)$$
$$\left\{ {{\rm P}\left( x \right) \wedge Q\left( x \right)} \right\}$$

$$\left( {\forall \,x} \right)\,\left\{ {{\rm P}\left( x \right) \vee Q\left( x \right)} \right\} \to \left( {\forall \,x} \right)\,\,$$
$${\rm P}\left( x \right) \vee \left( {\forall \,x} \right)\,\,Q\left( x \right)$$

$$\left( {\exists \,x} \right)\,\,\left\{ {{\rm P}\left( x \right) \vee Q\left( x \right)} \right\} \to \sim \left( {\forall \,x} \right)\,\,$$
$$\,{\rm P}\left( x \right) \vee \left( {\exists \,x} \right)Q\left( x \right)$$