Memory layout

Since the irregularity of 3-D land data appears in both azimuth and offset distributions, there is no prreferential direction for data movement. Hence, Biondi had the idea of a spiral data movement alternating the shifts along the x- and y- axes. The algorithm can be outlined as follows:

1.

The data are sorted by offset length into classes.

2.

For each bin of the output space, the trace of the current class whose midpoint falls into the bin is loaded in-processor.

3.

The DMO stretch is performed in parallel over output space.

4.

The traces are moved to the neighboring processor according to a spiral pattern illustrated in Figure .

 

spiral Figure 2 Spiral pattern for data movement over output space. The shaded squares represent the processors that actually perform the stretch and the stack to the output. The white squares represent the processors that stay idle during the movement of the trace.