This Article 
 Bibliographic References 
 Add to: 
Associative Nets: A Graph-Based Parallel Computing Model
May 1997 (vol. 46 no. 5)
pp. 558-571

Abstract—This paper presents a new parallel computing model called Associative Nets. This model relies on basic primitives called associations 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.

[1] K.E. Batcher, "Design of a Massively Parallel Processor," IEEE Trans. Computers, vol. 29, no. 9, pp. 836-840, Sept. 1980.
[2] M. Duff, "CLIP4, A Large Scale Integrated Circuit Array Parallel Processor," Proc. Third Int'l Conf. Pattern Recognition, pp. 728-733, 1976.
[3] "Connection Machine Model 2 Technical Summary," Technical Report HA87-4, Thinking Machines Corp. 1987.
[4] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 1989.
[5] B.A. Khale and W.D. Hillis, "The Connection Machine Model CM-1 Architecture," Technical Report HA87-5, Thinking Machines Corp., 1987.
[6] C. Leiserson et al., "The Network Architecture of the Connection Machine CM-5," Proc. Joint Conf. Vector and Parallel Processing,Lyon, France, Sept. 1992.
[7] T. Blank, "The MasPar MP-1 Architecture," Proc. 35th IEEE CS Int'l Conf. (Spring CompCon '90),San Francisco, 1990.
[8] M. Maresca and H. Li, "Polymorphic VLSI Arrays with Distributed Control," Reconfigurable Massively Parallel Computers, pp. 33-63. Prentice Hall, 1991.
[9] B. Shu, J. Nash, M. Eshagian, and K. Kim, "Implementation of a Gated Connection Network in Image Understanding," Reconfigurable Massively Parallel Computers, pp. 64-87. Prentice Hall, 1991.
[10] C.C. Weems, S.P. Levitan, A.R. Hanson, E.M. Riseman, D.B. Shu, and J.G. Nash, "The Image Understanding Architecture," Int'l J. Computer Vision, vol. 2, no. 3, pp. 251-282, 1989.
[11] M.G. Albeanesi, V. Cantoni, U. Cie, M. Ferretti, and M. Mosconi, "Embedding Pyramids into Mesh Arrays," Reconfigurable Massively Parallel Computers, pp. 123-140. Prentice Hall, 1991.
[12] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678-692, June 1993.
[13] Y.-C. Chen and W.-T. Chen, "Constant Time Sorting on Reconfigurable Meshes," IEEE Trans. Computers, vol. 43, no. 6, pp. 749-751, June 1994.
[14] M. Metcalf and J. Reid, Fortran 90 Explained. Oxford Univ. Press, 1990.
[15] G.E. Blelloch,Vector Models for Data-Parallel Computing. The MIT Press, 1990.
[16] A. Mérigot, "Associative Nets: A New Parallel Computing Model," technical report, Institut d'Electronique Fondamentale, UniversitéParis Sud, 91405 Orsay, France, 1992.
[17] C.S. Wallace, "A Suggestion for a Fast Multiplier," IEEE Trans. Electronic Computers, vol. 13, pp. 14-17, 1964.
[18] L. Dadda, "Some Schemes for Parallel Multipliers," Alta Freq., vol. 34, pp. 349-356, 1965.
[19] P.R. Capello and K. Steiglitz, "A VLSI Layout for a Pipeline Dadda Multiplier," ACM Trans. Computer Design, vol. 1, no. 2, pp. 157-174, May 1983.
[20] S. Mohammadi, "techniques asynchrones pour la réalisation d'une machine massivement parallèle reconfigurable," thèse de doctorat, UniversitéParis sud, Orsay, France, June 1996.
[21] D. Dulac, S. Mohammadi, and A. Mérigot, "Implementation and Evaluation of a Parallel Architecture Using Asynchronous Communications," Proc. 1995 Workshop Computer Architecture for Machine Perception, L. Lombardi, V. Cantoni et al., eds., pp. 106-111,Como, Italy, Sept. 1995.
[22] D. Dulac, "Contribution au parallélisme massif en analyse d'images: une architecture SIMD fondée sur la reconfigurabilitéet l'asynchronisme," thèse de doctorat, UniversitéParis sud, Orsay, France, Jan. 1996.
[23] C.C. Foster, Content-Addressable Parallel Processors, Van Nostrand Reinhold, New York, 1976.
[24] A. Mérigot, D. Dulac, and S. Mohammadi, "A New Scheme for Massively Parallel Image Analysis," Proc. 12th Int'l Conf. Pattern Recognition, vol. 3, pp. 352-356,Jerusalem, Oct. 1994.
[25] D. Dulac, A. Mérigot, and S. Mohammadi, "Associative Meshes: A New Parallel Architecture for Image Analysis," Proc. 1993 Workshop Computer Architecture for Machine Perception, L.S. Davis, M.A. Bayoumi, and K.P. Valavanis, eds., pp. 393-399,New Orleans, Dec. 1993.
[26] S.E. Goodman and S.T. Hedetniemi, Introduction to the Design and Analysis of Algorithms, chapter 5. McGraw-Hill, 1977.
[27] E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
[28] R. Bellman, "On a Routing Problem," Quarterly of Applied Mathematics, vol. 16, no. 1, pp. 87-90, 1958.
[29] L.R. Ford and S.M. Johnson, "A Tournament Problem," The Am. Mathematic Monthly, vol. 66, pp. 387-389, 1959.
[30] H. Li and Q. Stout,Reconfigurable Massively Parallel Computers.Englewood Cliffs, NJ: Prentice-Hall, 1991.

Index Terms:
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. 5, pp. 558-571, May 1997, doi:10.1109/12.589222
Usage of this product signifies your acceptance of the Terms of Use.