 However, radial scanning algorithms imply a large number of accesses to 2D arrays , which despite being regular, results in poor data locality . This paper proposes a new methodology , termed sDEM , which substantially improves the locality of memory accesses and largely increases the inherent parallelism involved in the computation of radial scanning algorithms.
<meaning-changed>  However, radial scanning algorithms imply a large number of accesses to 2D arrays , which despite being regular, results in poor data locality . This paper proposes a new methodology , termed sDEM , which substantially improves the locality of memory accesses and largely increases the inherent parallelism involved in the computation of radial scanning algorithms.
 However, radial scanning algorithms imply a large number of accesses to 2D arrays , which despite being regular, results in poor data locality in memory. Here, we propose a new methodology , termed sDEM , which substantially improves the locality of memory accesses and largely increases the inherent parallelism involved in the computation of radial scanning algorithms.