Mapping model with Inter-array memory sharing for multidimensional signal processing
暂无分享,去创建一个
[1] Paul Feautrier,et al. Automatic Storage Management for Parallel Programs , 1998, Parallel Comput..
[2] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[3] Gerda Janssens,et al. Storage Size Reduction by In-place Mapping of Arrays , 2002, VMCAI.
[4] Francky Catthoor,et al. Data dependency size estimation for use in memory optimization , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[5] Joos Vandewalle,et al. In-place memory management of algebraic algorithms on application specific ICs , 1991, J. VLSI Signal Process..
[6] Florin Balasa,et al. Computation of Storage Requirements for Multi-Dimensional Signal Processing Applications , 2007, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[7] C Berge,et al. TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[8] Harold Neil Gabow,et al. Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .
[9] Hugo De Man,et al. Memory Size Reduction Through Storage Order Optimization for Embedded Parallel Multimedia Applications , 1997, Parallel Comput..
[10] Robert E. Tarjan,et al. Faster scaling algorithms for general graph matching problems , 1991, JACM.
[11] Gilles Villard,et al. Lattice-based memory allocation , 2003, IEEE Transactions on Computers.
[12] Sanjay V. Rajopadhye,et al. Optimizing memory usage in the polyhedral model , 2000, TOPL.
[13] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[14] Florin Balasa,et al. Signal-to-Memory Mapping Analysis for Multimedia Signal Processing , 2007, 2007 Asia and South Pacific Design Automation Conference.