A polynomial-time algorithm for memory space reduction

DOI10.1007/S10766-004-1459-8MaRDI QIDQ2572378zbMATH OpenOpenAlexFDO

Authors Yonghong Song, Cheng Wang, Zhiyuan Li

Publication date 16 November 2005

Published in International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10766-004-1459-8

zbMATH Keywords

optimizationgraph theorycompilersnetwork flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10) Theory of compilers and interpreters (68N20)

Recommendations

• scientific article; zbMATH DE number 2090858
• scientific article; zbMATH DE number 1305512
• SMO: an integrated approach to intra-array and inter-array storage optimization
• Publication:4735042
• Memory size reduction through storage order optimization for embedded parallel multimedia applications

Cites work

• scientific article; zbMATH DE number 814824 (Why is no real title available?)
• Memory size reduction through storage order optimization for embedded parallel multimedia applications
• Retiming synchronous circuitry

Cited in

(7)

• scientific article; zbMATH DE number 2090858 (Why is no real title available?)
• Fast greedy weighted fusion
• Memory-tight reductions
• SMO: an integrated approach to intra-array and inter-array storage optimization
• scientific article; zbMATH DE number 3907783 (Why is no real title available?)
• scientific article; zbMATH DE number 1760016 (Why is no real title available?)
• Memory-Efficient Algorithms for Finding Needles in Haystacks

This page was built for publication: A polynomial-time algorithm for memory space reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572378)