Our previous work presented methods of accelerating nondeterministic discrete event simulation at the processing element level. Here, two algorithms are proposed for synchronizing a network of processing elements according to the next network minimum event timestamp. One method has an expected running time of O(k) while the second has an expected running time of O(k log(k)). A network architecture is developed and simulation results of the time expected to locate and broadcast the next network minimum timestamp are reported.