ILP Formulation and Solution Strategies for Memory Command Scheduling

A memory pattern is a small series of scheduled SDRAM commands with known length and function. This article describes an ILP formulation that generates predictable memory patterns that implement a close-page policy. The generated patterns are optimal in terms of length, i.e. there is no other permutation of this set of commands satisfying pattern scheduling rules and timing constraints resulting in a shorter pattern