Analysis and approximation for bank selection instruction minimization on partitioned memory architecture

DOI10.1007/s10878-010-9365-zzbMath1243.90273OpenAlexW2126184512MaRDI QIDQ421269

Yingchao Zhao, Chun Jason Xue, Tiantian Liu, Minming Li

Publication date: 23 May 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9365-z

zbMATH Keywords

approximation algorithmsNP-hardnessroundingbank selection instruction minimizationpartitioned memory architecture

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (1)

Register loading via linear programming

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis and approximation for bank selection instruction minimization on partitioned memory architecture