The idea of block updating is commonly used for regular graphs. For example, as first noted in Ref. [1]}, when the graph is bipartite (as in Restricted Boltzmann Machines or chessboard lattices), a trivial coloring (with two colors, black and white) is possible and this is often exploited in updating each color block in parallel [2]}, [3]}, [4]}, [5]}, [6]}. We also note that parallelization techniques in multiple FPGAs have recently been explored for other types of Ising Machines [7]}, however these are based on completely different algorithms unrelated to the computational model we use based on Eq. (REF )-(REF ).
