Provides a comprehensive, deep, but readily understood insight into the programming of regular arrays. The emphasis is on methodologies, complexity results, and unified formulations. It studies interconnecting structures ranging from meshes to trees to the perfect shuffle. The basic cells are either fast combinatorial modules or small programmable microprocessors.