Algorithms for Parallel-Search Memories
Journal of the ACM (JACM)
Associative Computing: A Programming Paradigm for Massively Parallel Computers
Associative Computing: A Programming Paradigm for Massively Parallel Computers
Timing for Associative Operations on the MASC Model
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Multiple Instruction Stream Control for an Associative Model of Parallel Computation
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
IPDPSW '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Recent computing hardware technologies such as the Intel Xeon Phi and NVIDIA CUDA family of hardware coprocessors have had tremendous impact on how computer scientists program parallel computers. As an alternative to the traditional parallel thread based models (OpenMP) or multicomputer message passing models (MPI), associative processing is the concept of extending the use of associative memories into a more general parallel computing environment. The Associative Computing model (ASC) is both a model of parallel computation and a programming language. Associative computing includes the use of data parallel programming and the ability to search memory by data content rather than memory address. Unlike programming MIMD computers, ASC programmers are not responsible for task allocation, load balancing, synchronization points, etc. This paper serves a gentle introduction to the ASC model. The properties of the ASC model and hardware realizations are discussed along with examples of using the ASC programming language.