Data merging for shared-memory multiprocessors

An efficient software cache consistency mechanism for shared-memory multiprocessors that supports multiple writers and works for cache lines of any size is described. The mechanism relies on the fact that for a correct program only the global memory needs a consistent view of the shared data between synchronization points. The delayed consistency mechanism allows arbitrary use of data blocks between synchronizations. In contrast to other mechanisms, the mechanism needs no modification to the processor hardware or any assistance from the programmer or compiler. The processors can use normal cache management policies. Since no special action is needed to use the shared data, the processors are free to act almost as if they are all running out of a single cache. The global memory units are nearly identical to those on currently available machines. Only a small amount of hardware and/or software is needed to implement the mechanism. The mechanism can even be implemented using network-connected workstations.