Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays

Journal of Parallel and Distributed Computing

Volumn 64, Issue 3, 2004, Pages 345-359

  Djamegni, Clémentin Tayou ^a  

^a UNIVERSITY OF DSCHANG   (Cameroon)

Author keywords

Allocation function; Dependence graph; Dependence vector; Projection methods; Re indexation; Schedule; Space complexity; System of uniform recurrence equations

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; FUNCTIONS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING; VLSI CIRCUITS;

PROJECTION METHODS; RE-INDEXATION; SPACE COMPLEXITY; SPACE-OPTIMAL ARRAYS;

SYSTOLIC ARRAYS;

EID: 2942576712     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2003.04.002     Document Type: Article

References (43)

1. Benaini A., Robert Y. space-time minimal systolic arrays for Gaussian elimination and the algebraic path problem. Parallel Comput. 15:1990;135-158.
2. Cappello P. A processor-time-minimal systolic array for cubical mesh algorithms. IEEE Trans. Parallel Distrib. Systems. 3(1):January 1992;4-13.
3. Chen M.C. A design methodology for synthesizing parallel algorithms and architectures. J. Parallel Distrib. Comput. 3(4):1986;461-491.
4. P. Clauss, C. Mongenet, G.R. Perrin, Calculus of space-optimal mappings of systolic algorithms on processor arrays. IEEE International Conference on Application Specific Array Processors, 1990, pp. 591-602.
5. P. Clauss, G.R. Perrin, Optimal mapping of systolic algorithms by regular instructions shifts, International Conference on Application-Specific Array Processors, ASAP'94, San Francisco, CA, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 224-235.
6. A. Darte, T. Risset, Y. Robert, Synthesizing systolic arrays: some recent developments, International Conference on Application Specific Array Processors, IEEE Computer Society Press, Silver Spring, MD, 1991, pp. 372-386.
7. C.T. Djamegni, Contribution to the synthesis of optimal algorithms for regular arrays, Thèse de Doctorat, Department of Computer Science, University of Yaoundé I-Cameroon, December 1997.
8. Djamegni C.T., Quinton P., Rajopadhye S., Risset T. Derivation of systolic algorithms for the algebraic path problem by recurrence transformations. Parallel Comput. 26(11):2000;1429-1445.
9. Djamegni C.T., Tchuente M. Scheduling of the DAG associated with pipeline inversion of triangular matrices. Parallel Process. Lett. 6(1):1996;13-26.
10. Djamegni C.T., Tchuente M. A new algorithm for dynamic programming on regular arrays. Parallel Process. Lett. 10(1):2000;15-27.
11. Ganapathy K.N., Wah B.W. Optimal synthesis of algorithm-specific lower-dimensional processor arrays. IEEE Trans. Parallel Distrib. Systems. 7(3):March 1996;274-287.
12. Hou Y.C., Tsay J.C. Equivalent transformations on systolic design represented by generating functions. J. Inform. Sci. Eng. 5:1992;229-250.
13. M. Huber, J. Teich, L. Thiele, Design of configurable processor arrays, Proceedings of ISCAS'90, New Orleans, 1990, pp. 970-973.
14. Karp R.M., Miller R.E., Winograd S. The organization of computations for uniform recurrence equations. J. ACM. 14(3):1967;563-590.
15. H.T. Kung, C.E. Leiserson, Systolic arrays (for VLSI), in: I.S. Duff, et al. (Eds.), Sparse Matrix, Proc. Soc. Ind. App. Math., 1979, pp. 256-282.
16. Lamport L. The parallel execution of Do loops. Commun. ACM. 17(2):1974;83-93.
17. V. Loechner, C. Mongenet, Solutions to the communication minimization problem for affine recurrence equations, ICPS RR 97-06, February 1997, http://icps.u-strasbg.fr/pub-97/.
18. Mead C., Conway L. Introduction to VLSI Systems. 1980;Addison-Wesley, Reading, MA.
19. Melhem R.G., Rheinboldt W.C. A mathematical model for the verification of systolic networks. SIAM J. Comput. 13:1984;541-565.
20. Peir J.K., Cytron R. Minimum distance: a method for partitioning recurrences for multiprocessors. IEEE Trans. Comput. 38(8):August 1989;1203-1211.
21. P. Quinton, Automatic synthesis of systolic arrays from uniform recurrence equations, in: Proceedings of IEEE 11th Annual International Conference on Computer Architecture, Ann Arbor, 1984, pp. 208-214.
22. Quinton P., Dongen V.V. The mapping of linear equations on regular arrays. J. VLSI Signal Process. 1(2):1989;95-113.
23. Rajopadhye S.V. Synthesizing systolic arrays with control signal from recurrence equations. Distrib. Comput. 3:1989;88-105.
24. Rajopadhye S.V., Fujimoto R.M. Synthesizing systolic arrays from recurrences equations. Parallel Comput. 14:1990;163-189.
25. S. Rao, T. Kailath, What is a systolic algorithm, Proceedings of Highly Parallel Signal Processing Architectures, SPIE, Los Angeles, CA, January 1986, pp. 34-48.
26. Rao S., Kailath T. Regular iterative algorithms and their implementation on processors arrays. Proc. IEEE. 76(4):1988;259-269.
27. Sakho I., Tchuente M. Méthode de conception d'algorithmes paralleles pour réseaux reguliers. Tech. Sci. Inform. 8:1989;63-72.
28. Scheiman C., Cappello P.R. A processor-time minimal array for transitive closure. IEEE Trans. Parallel Distrib. Systems. 3(3):1992;257-269.
29. Scheiman C., Cappello P. A processor-time minimal design for 3D rectilinear mesh algorithms. Parallel Process. Lett. 6(4):1996;539-550.
30. Shang W., Fortes J.A.B. Time optimal linear schedules for algorithms with uniform dependencies. IEEE Trans. Comput. 40:1991;723-742.
31. Shang W., Fortes J.A.B. On mapping of uniform dependence algorithms into lower dimensional processors arrays. IEEE Trans. Parallel Distrib. Systems. 3:1992;350-363.
32. Swaaij M.V., Rosseel J., Catthoor F., Man H.D. Synthesis of ASIC regular arrays for real-time image processing systems. J. VLSI Signal Process. 3:1991;183-192.
33. Tchuente M. Parallel computation on regular arrays. 1992;Manchester University Press, Manchester and Wiley, NY, USA.
34. Teich J., Thiele L. Control generation in the design of processor arrays. J. VLSI Signal Process. 3:1991;77-92.
35. Teich J., Thiele L. Partitioning of processor arrays: a piecewise regular approach. INTEGRATION, VLSI J. 14:1993;297-332.
36. Thiele L. Resource constrained scheduling of uniform algorithms. J. VLSI Signal Process. 10(3):August 1995;295-310.
37. L. Thiele, V. Roychowdhury, Systematic design of local processor arrays for numerical algorithms, in: E.F. Deprettere, A.J. Van der Veen (Eds.), Algorithms and Parallel VLSI Architectures, Vol. A: Tutorials, Elsevier, Amsterdam, 1991, pp. 329-339.
38. Tsay J.C., Chang P.Y. Design of space-optimal regular arrays for algorithms with linear schedules. IEEE Trans. Comput. 44(5):1995;683-694.
39. V. Van Dongen, Quasi-regular arrays: definition and design methodology, in: J. McCanny, J. McWhirter, E. Swartzlander (Eds.), Systolic Array Processors. Proc. Int. Conf. on Systolic Arrays. Killarney, Co. Kerry, Ireland, Prentice-Hall, Englewood Cliffs, NJ, 1989, pp. 126-135.
40. Y. Wong, J.M. Delosme, Space-optimal linear processor allocation for systolic arrays synthesis, Proceedings of the Sixth International Parallel Processing Symposium, 1992, pp. 275-282.
41. Wong Y., Delosme J.M. Transformation of broadcasts into propagations in systolic algorithms. J. Parallel Distrib. Comput. 14:1992;121-145.
42. Xue J. Specifying control signals for systolic arrays by uniform recurrence equations. Parallel Process. Lett. 1:1991;83-93.
43. J. Xue, The formal synthesis of control signals for systolic arrays, Ph.D. Thesis, Technical Report ECS-LFCS-92-203, Department of Computer Science, University of Edinburgh, 1992.