Ordered access memory and its application in parallel processors



Journal Title

Journal ISSN

Volume Title


Lviv Politechnic Publishing House


In this paper, after analyzing the known memory access methods, conventional memory organization and its challenging problems, we propose new ordered memory access method and a new type of memory – the ordered access memory. This method is aimed at working with data arrays and provides memory access in the prescribed manner. Proposed method unlike widely used method of sequential memory access allows extending the functionality of the memory as it provides not only sequential, but also any other ordered memory access. Unlike another widely used method of address memory access, the implementation of the proposed method provides parallel conflict-free memory access. It also allows eliminating data binding to a specific memory location that makes it possible to disintegrate the apparatus for data ordering and eliminates the need to store addresses of locations the data are placed in, and the need to submit the address to the address inputs during data writing and reading. The new method distinctive features compared to the known memory access methods are considered. Input data, their indices and output data of the ordered access memory are described as well as the approaches to this type of memory design and use. The interface of the ordered access memory is considered as well as its advances compared to the random, associative, and sequential access memories. An example of the ordered access memory usage in application-specific processors with parallel and pipeline structures is demonstrated and the results of the ordered access memory implementation in FPGA are considered.



Computer memory, Memory wall, Memory types, Parallel memory, Memory access method, Ordered access memory, Memory organization, Parallel processors


Melnyk A. Ordered access memory and its application in parallel processors / Anatoliy Melnyk // Advances in Cyber-Physical Systems. — Lviv : Lviv Politechnic Publishing House, 2017. — Vol 2. — No 2. — P. 54–62.