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