A comparison of sequential and associate computing of priority queues

Authors:
Barry M. Landson;Robert G. Sargent
Affiliations:
United States Air Force, ACS/Studies and Analysis, Washington, D.C.;Department of Industrial Engineering and Operations Research, Syracuse University, Syracuse, New York
Venue:
CAW '77 Proceedings of the 3rd workshop on Computer architecture : Non-numeric processing
Year:
1977

Citing 2
Cited 1

The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
A comparison of sequential and associative computing of priority queues with applications to discrete simulation and time flow mechanisms.

A comparison of sequential and associative computing of priority queues with applications to discrete simulation and time flow mechanisms.

A dynamic address computation mechanism for use in database management

SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.