Associative nets: A graph-based parallel computing model

IEEE Transactions on Computers

Volumn 46, Issue 5, 1997, Pages 558-571

  Mérigot, Alain ^a  

^a CNRS   (France)

Author keywords

Asynchronous logic; Bit serial arithmetic; Fine grain parallelism; Graph processing; Parallel algorithms; Parallel programming models; SIMD

Indexed keywords

COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; GRAPHIC METHODS; MATHEMATICAL MODELS; PARALLEL ALGORITHMS;

GRAPH BASED PARALLEL COMPUTING MODEL;

PARALLEL PROCESSING SYSTEMS;

EID: 0031369479     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.589222     Document Type: Article

References (30)

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, Design and Analysis of Parallel Algorithms. Prentice Hall, 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. Computers, vol. 42, no. 6, 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. Cambridge, Mass.: 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. Forster, Content Addressable Parallel Processors. Van Nostrand Reinhold, 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. Prentice Hall, 1991.