Two approaches for control store width minimization

Abstract

This paper presents two new approaches for control memory width minimization problem. One uses integer linear programming, and the other is based on heuristic partitioning. The integer linear programming method guarantees optimal solutions of reasonable size problem within small amount of time. The heuristic partition approach obtains near optimal solutions for the problems of any size with the time complexity of O(n$^3$ logn).