Issue No. 05 - May (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.589222
<p><b>Abstract</b>—This paper presents a new parallel computing model called <it>Associative Nets</it>. This model relies on basic primitives called <it>associations</it> that consist to apply an associative operator over connected components of a subgraph of the physical interprocessor connection graph. Associations can be very efficiently implemented (in terms of hardware cost or processing time) thanks to asynchronous computation. This model is quite effective for image analysis and several other fields; as an example, graph processing algorithms are presented. While relying on a much simpler architecture, these algorithms have, in general, a complexity equivalent to the one obtained by more expensive computing models, like the PRAM model.</p>
Parallel programming models, parallel algorithms, fine grain parallelism, SIMD, bit-serial arithmetic, graph processing, asynchronous logic.
Alain Mérigot, "Associative Nets: A Graph-Based Parallel Computing Model", IEEE Transactions on Computers, vol. 46, no. , pp. 558-571, May 1997, doi:10.1109/12.589222