Conflict-Free Block-with-Stride Access of 2D Storage Structure

  • Rui Song
  • Guozhao Zeng
  • Sheng LiuEmail author
  • Haiyan Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11336)


Parallel memory modules can be used to increase memory bandwidth and feed a processor with the required access patterns of data. The parallel storage mechanism organized and managed by multiple storage modules can suit applications of images and videos. Previous investigation into data storage schemes can be used to achieve continuous conflict free access by rows, columns or blocks, however it is not only satisfied with some sliding window applications in video and image processing algorithms (including convolutional neural networks, sub-pixel difference, 2D filtering, etc.) which need non-conflicting access by steps in computation, but also there is a different demand for horizontal and vertical strides in computing sub-processes. This paper presents a storage scheme that support for row access without collision alignment, and non-aligned block-with-stride access storage modes beginning at any address. Theoretical proofs and experiments verify the correct ness of the module address (module number to which the address is mapped). And in hardware design, it was found that in the typical case there was no path violation and with less area overhead. It suitable for application of CNN to improve performance in algorithm in convolutional.


Main memory architectures 2D memory conflicts Parallel storage scheme 


  1. 1.
    Chen, S., Postula, A., Jozwiak, L.: Synthesis of XOR storage schemes with different cost for minimization of memory contention. In: 1999 Proceedings of the Euromicro Conference, vol. 1, pp. 170–177. IEEE (1999)Google Scholar
  2. 2.
    Hartenstein, R.W., Becker, J., Herz, M., Nageldinger, U.: An embedded accelerator for real world computing. In: Reis, R., Claesen, L. (eds.) VLSI: Integrated Systems on Silicon. ITIFIP, pp. 215–226. Springer, Boston (1997). Scholar
  3. 3.
    Aho, E., Vanne, J., Kuusilinna, K., et al.: Address computation in configurable parallel memory architecture. IEICE Trans. Inf. Syst. 87-D(7), 1674–1681 (2004)Google Scholar
  4. 4.
    Takala, J., Jarvinen, T.: Stride permutation access in interleaved memory systems (2003)Google Scholar
  5. 5.
    Budnik, P., Kuck, D.J.: The organization and use of parallel memories. IEEE Trans. Comput. 20(12), 1566–1569 (1971)CrossRefGoogle Scholar
  6. 6.
    Park, J.W.: An efficient buffer memory system for subarray access. IEEE Trans. Parallel Distrib. Syst. 12(3), 316–335 (2002)CrossRefGoogle Scholar
  7. 7.
    Park, J.W.: Multiaccess memory system for attached SIMD computer. IEEE Trans. Comput. 53(4), 439–452 (2004)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Park, J.W.: Conflict-free memory system and method of address calculation and data routing by using the same. US 6845423 B2[P], US (2005)Google Scholar
  9. 9.
    Hong, Y., Choi, B., Lee, K., et al.: Conflict management considering a smooth transition of aircraft into adjacent airspace. IEEE Trans. Intell. Transp. Syst. 17(9), 2490–2501 (2016)CrossRefGoogle Scholar
  10. 10.
    Liu, C., Yan, X., Qin, X.: An optimized linear skewing interleave scheme for on-chip multi-access memory systems. In: ACM Great Lakes Symposium on VLSI, pp. 8–13. ACM (2007)Google Scholar
  11. 11.
    Liu, S., Chen, S., Chen, H., et al.: A novel parallel memory organization supporting multiple access types with matched memory modules. IEICE Electron Express 9(6), 602–608 (2012)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Rui Song
    • 1
  • Guozhao Zeng
    • 1
  • Sheng Liu
    • 1
    Email author
  • Haiyan Chen
    • 1
  1. 1.College of ComputerNational University of Defense TechnologyChangshaChina

Personalised recommendations