A comparison of priority queues on four different types of computer memories are made by ring a model to determine the total time to do comparable tasks. The four types of memories compared are random access (RAM), associate (AM), hybrid consisting of an associate memory and a random access memory (AM/RAM), and the hybrid memory with an auxiliary memory having the @@@@pability to perform Lewin's Associate algorithm @@@@, (AM/RAM/AML). The model used for the comparisons is an extension of the MIX model developed by Knuth 1. The MIX model was extended to include the four types of memories and the instruction set expanded include @@@@ instructions for the memories added. This @@del allows direct comparisons to be made of the different architectures and different software algorithms in performing the same tasks.
/lp/association-for-computing-machinery/a-comparison-of-sequential-and-associate-computing-of-priority-queues-Woh47Ne20v