Several decomposition methods are considered for solving block-angular prog
rams (BAPs) in parallel. We present a computational comparison of synchrono
us multicoordination methods. The most efficient of these approaches is sho
wn to involve an intermediate number of blocks in the coordination phase.