Parallel ordered-access machine computational model and architecture

Abstract

The article presents the new computational model which we name the parallel ordered-access machine because of its base – the parallel ordered-access memory. It also describes the computer architecture which implements proposed computational model and owing to this does not have such a limitation as the memory wall and provides parallel conflict-free memory access. The efficiency of the proposed ordered-access machine computational model is evaluated and an example of its implementation is presented.