Derivation of systolic algorithms for the algebraic path problem by recurrence transformations

Parallel Computing

Volumn 26, Issue 11, 2000, Pages 1429-1445

  Djamégni, Clémentin Tayou ^a   Quinton, Patrice ^b   Rajopadhye, Sanjay ^b   Risset, Tanguy ^b  

^a UNIVERSITÉ DE DSCHANG   (Cameroon)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Algebraic path problem; Dependence graph; Systolic architectures; Uniform recurrence equations

Indexed keywords

EID: 18744433892     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(00)00039-9     Document Type: Article

References (33)

1. A. Benaini, P. Quinton, Y. Robert, Y. Saouter, B. Tourancheau, Synthesis of a new systolic architecture for the algebraic path problem, Sci. Comput. Prog. 15 (1990) 135-158.
2. A. Benaini, Y. Robert, Space-time minimal systolic arrays for Gaussian elimination and the algebraic path problem, Parallel Comput. 15 (1990) 211-225.
3. A. Benaini, Y. Robert, B. Tourancheau, A new systolic architecture for the algebraic path problem, in: J. McCanny et al. (Eds.), Systolic Array Processors, Prentice-Hall, Englewood Cliffs, 1989, pp. 73-82.
4. P.R. Cappello, C.J. Scheiman. A processor-time minimal systolic array for transitive closure, in: S.Y. Kung et al. (Eds.), Application Specific Array Processors, IEEE Computer Society Press, 1990, pp. 19-30.
5. P. Clauss, C. Mongenet, G.R. Perrin, Calculus of space-optimal mappings of systolic algorithms on processors arrays, in: IEEE Internaternational Conference on Application Specific Arrays Processors, ASAP'90, 1990.
6. P. Clauss, C. Mongenet, G.R. Perrin, Synthesis of size-optimal toroidal arrays for the algebraic path problem: a new contribution, Parallel Comput. 18 (1992) 185-194.
7. S.P.Y. Chang, J.C. Tsay, A family of efficient regular arrays for the algebraic path problem, IEEE Trans. Parallel Distrib. Systems 43 (7) (1994) 769-777.
8. J.M. Delosme, A parallel algorithm for the algebraic path problem, in: M. Cosnard et al. (Eds.), Parallel and Distributed Algorithm, North-Holland, Amsterdam, 1989, pp. 67-78.
9. L. Guibas, H.T. Kung, C.D. Thompson, Direct VLSI implementation of combinatorial algorithms, in: Proceedings of the Caltech Conference on VLSI, Pasadena, 1979, pp. 509-525.
10. S.Y. Kung, S.C. Lo, A spiral systolic algorithm/architecture for transitive closure problems, in: International Conference on Circuit Design (ICCD), Rye Town, NY, 1985, pp. 622-626.
11. P. Lee, Z.M. Kedem, Mapping nested loop algorithms into multidimensional systolic arrays, IEEE Trans. Parallel Distrib. Systems 1 (1) (1990) 64-76.
12. S.Y. Kung, S.C. Lo, P.S. Lewis, Optimal systolic design for the transitive closure and the shortest path problems, IEEE Trans. Comput. C 36 (5) (1987) 603-614.
13. P.S. Lewis, S.Y. Kung, An optimal systolic array for the algebraic path problem, IEEE Trans. Comput. 40 (1) (1991) 100-105.
14. C. Mauras, ALPHA: Un lagage équationnel pour la conception et la programmation d'architectures paralléles et synchrones, Ph.D. thesis, Université de Rennes I, IRISA, Campus de Beaulieu, 1990.
15. D.I. Moldovan, On the analysis and synthesis of VLSI algorithms, IEEE Trans. Comput. C 31 (11) (1982) 1121-1126.
16. J.F. Myoupo, A.C. Fabret, Modular systolic linearization of the Warshall-Floyd algorithm, IEEE Trans. Parallel Distrib. Systems 7 (5) (1996) 449-455.
17. J.G. Nash, S. Hasen. Modified faddeew algorithm for matrix multiplication, in: Proceedings of the SPIE (Society of photo-optical instrumentation engineers), Real-time Signal Processing, 1984, pp. 39-46.
18. P. Quinton, Automatic synthesis of systolic array from uniform recurrence equations, in: Proceedings of the IEEE 11th Annual International Conference on Computer Architecture, Ann Arbor, 1984, pp. 208-214.
19. P. Quinton, V. Dongen, The mapping of linear equations on regular arrays, J. VLSI Signal Processing 1 (2) (1989) 95-113.
20. P. Quinton, Y. Robert. Algorithmes et architectures systolique, Masson, 1989.
21. S.V. Rajopadhye, Synthesizing systolic arrays with control signals from recurrence equations, Distrib. Comput. 3 (1989) 88-105.
22. S.V. Rajopadhye, R.M. Fujimoto, Synthesizing systolic arrays from recurrence, Parallel Comput. 14 (1990) 163-189.
23. S.V. Rajopadhye, An improved systolic algorithm for the algebraic path problem, Integration VLSI J. 14 (1993) 279-296.
24. T. Risset, Y. Robert, Synthesis of processors arrays for the algebraic path problem: unifying old results and deriving new architectures, Parallel Processing Lett. 1 (1) (1991) 19-28.
25. Y. Robert, M. Tchuenté, Résolution systolique de systémes linéaires denses, RAIRO modélisation et analyse numérique, Technique et Sciences Informatiques 19 (2) (1985) 315-326.
26. Y. Robert, D. Trystram, Systolic solution of the algebraic path problem, in: W. Moore et al. (Eds.), Systolic Arrays, Adam Hilger, Bristol, 1987, pp. 171-180.
27. G. Rote, A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion), Computing 34 (3) (1985) 191-219.
28. I. Salko, M. Tchuenté, Une méthode de conception d'algorithmes systoliques pour réseaux réguliers, Technique et Sciences Informatiques 8 (1989) 63-72.
29. C.T. Djamegni, M. Tchuenté, Scheduling of the DAG associated with pipeline inversion of triangular matrices, Parallel Processing Lett. 6 (1) (1996) 13-26.
30. C.T. Djamegni, Contribution to the synthesis of optimal algorithms for regular arrays, Thése de Doctorat, Department of Computer Science, University of Yaounde I, Cameroun, 1997.
31. M. Tchuenté, Parallel Computation on Regular Arrays, Wiley, New York, 1990.
32. Y. Wong, J.M. Delosme, Transformation of broadcasts into propagations in systolic algorithms, J. Parallel Distrib. Comput. 14 (1992) 121-145.
33. Yoav Yaacoby, Peter R. Cappello, Bounded broadcast in systolic arrays, Technical Report TRCS88-13, Computer Science Department, University of California, Santa Barbara, April 1988.