adjacent processor 39 s storage for both the current and neighboring segment values from a hardware point of view the differences between implementing a fan fold or cut and stack approach are not that great the main issue resides in the design of the processors at the edges of the design which must keep track of both new processed data and old unprocessed data for each point as well as having access to data of odd and even numbered segments by increasing the storage associated with each processing element pe and folding or cutting and stacking the mapping between the physical processors and virtual bit map very large problems can be manipulated given the novel addressing and memory addressing scheme adopted herein all the instruction types of the architecture including the neighbor instruction with a processor in each problem point can be implemented by a much smaller array processor by defining the number of segments in terms of rows and columns the edge values for the virtual bit map problem can be supplied from a limited number of registers as shown in detail below certain advantages accrue from following the fanfold or cut and stack technique the fanfold approach as can be seen from fig1 a has the advantage of not requiring wiring wrapped around the processor board such wrapped wires are necessary in the cut an stack approach to transfer values from the opposite side of the segment the countervailing problem in the use of the fanfold technique is that while the processor element pe can get the value of the adjacent crossboundry point from its own memory i e for an even numbered segment being operated on the processor element looks to the odd half of the memory.