Practical solutions for counting scalars and dependences in atomium - a memory management system for multidimensional signal processing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 16, Issue 2, 1997, Pages 133-145

  Balasa, Florin ^a,b   Catthoor, Francky ^c   De Man, Hugo J ^a,b  

^a IMEC   (Belgium)

^b Rockwell Semiconductor Systems   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Data dependence; Data flow analysis; Digital signal processing (dsp); Linearly bounded lattice; Polytope

Indexed keywords

ALGORITHMS; CELLULAR ARRAYS; COST EFFECTIVENESS; DATA REDUCTION; DIGITAL SIGNAL PROCESSING; STORAGE ALLOCATION (COMPUTER);

MEMORY MANAGEMENT SYSTEM; MULTIDIMENSIONAL SIGNAL PROCESSING;

DATA STORAGE EQUIPMENT;

EID: 0031073369     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.573828     Document Type: Article

References (27)

1. F. Balasa, F. Catthoor, and H. De Man, Background memory area estimation for multi-dimensional signal processing systems,IEEE Trans. VLSI Syst., vol. 3, pp. 157-172, June 1995.
2. _, Dataflow-driven memory allocation for multi-dimensional signal processing systemsProc. Int. Conf. Computer-Aided Design. Nov. 1994, pp. 31-34.
3. F. Balasa, Background memory allocation for multi-dimensional signal processing, Ph.D. dissertation, IMEC, Katholieke Univ. Leuven, Leuven, Belgium, 1995.
4. U. Banerjee, R. Eigenmann, A. Nicolau, and D. A. Padua, Automatic program parallelization,Proc. IEEE. vol. 81, pp. 211-243, Feb. 1993.
5. N. V. Chernikova, Algorithm for discovering the set of all the solutions of a linear programming problem,USSR Comput. Math. Math. Phys., vol. 8, pp. 282-293, 1968.
6. G. B. Dantzig and B. C. Eaves, Fourier-Motzkin elimination and its dual,J. Combinatorial Theory (A), vol. 14, pp. 288-297, 1973.
7. R. J. Duffin, On Fourier's analysis of linear inequality systems,Math. Program. Stud., vol. 1, pp. 71-95, 1974.
8. M. Dyer, On counting lattice points in polyhedra,SIAM J. Comput., vol. 20, pp. 695-707, Aug. 1991.
9. C. Eisenbeis, O. Temam, and H. Wijshoff, Fast enumeration of solutions for data dependence analysis and data locality optimizationProc. Int. Conf. Parallel Processing, Aug. 1993.
10. P. N. Hilfinger, J. Rabaey, D. Genin, C. Scheers, and H. De Man, DSP specification using the Silage languageProc. Int. Conf. Acoustics, Speech Signal Processing, Apr. 1990, pp. 1057-1060.
11. W. Li and K. Pingali, A singular loop transformation framework based on nonsingular matricesProc. 5th Anna. Workshop Languages Compilers Parallelism, Aug. 1992.
12. P. Lippens, J. van Meerbergen, W. Verhaegh, and A. van der Werf, Allocation of multiport memories for hierarchical data streamsProc. Int. Conf Computer-Aided Design, Nov. 1993, pp. 728-735.
13. T. H. Matheiss and D. S. Rubin, A survey and comparison of methods for finding all vertices of convex polyhedral sets,Math. Oper. Res., vol. 5, pp. 167-185, May 1980.
14. M. Minoux, Mathematical Programming - Theory and Algorithms. New York: Wiley, 1986.
15. L. J. Mordell, Lattice points in a tetrahedron and generalized Dedekind sums,J. Indian Math., vol. 15, pp. 41-46, 1951.
16. T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall, The double description methodContributions to the Theory of Games-Annals of Mathematics Studies, no. 28,
17. H. W. Kuhn and A. W. Tucker, Eds. Princeton, NJ: Princeton Univ. Press, 1953, pp. 51-73.
18. L. Nachtergaele, F. Catthoor, F. Balasa, F. Franssen, E. De Greef, H. Samsom, and H. De Man, Optimization of memory organization and partitioning for decreased size and power in video and image processing systemsProc. Int. Workshop Memory Technology, Design, Testing, Aug. 1995, pp. 82-87.
19. W. Pugh, A practical algorithm for exact array dependence analysis,Commun. ACM, vol. 35, pp. 102-114, Aug. 1992.
20. L. Ramachandran, D. D. Gajski, and V. Chaiyakul, An algorithm for array variable clusteringProc. European Design Test Conf., Feb. 1994, pp. 262-266.
21. H. Samsom, F. Franssen, F. Catthoor, and H. De Man, Verification of loop transformations for real time signal processing applicationsVLSI Signal Processing VII, J. Rabaey, P. Chau, and J. Eldon, Eds. New York: IEEE Press, 1994, pp. 208-217.
22. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.
23. N. Tawbi, Parallelization automatique: estimation des durées d'execution et allocation statique de processeurs, Ph.D. dissertation, Inst. Blaise Pascal, Université Paris, France, Sept. 1991.
24. L. Thiele, Compiler techniques for massive parallel architecturesState-of-the-Art in Computer Science, P. Dewilde, Ed. Norwell, MA: Kluwer, 1992.
25. M. van Swaaij, F. Franssen, F. Catthoor, and H. De Man, High-level modeling of data and control flow for signal processing systemsDesign Methodologies for VLSI DSP Architectures and Applications, M. Bayoumi, Ed. Norwell, MA: Kluwer, 1993.
26. I. Verbauwhede, C. Scheers, and J. M. Rabaey, Memory estimation for high level synthesisProc. 31st Design Automation Conf., June 1994, pp. 143-148.
27. D. Wilde, A library for doing polyhedral operations, M.Sc. thesis, Oregon Univ., Eugene, Dec. 1993.