An approach for dynamic selection of synthesis transformations based on Markov Decision Processes

• Published in: 2011 Design, Automation & Test in Europe pp. 1 - 4
• Main Authors: Welp, T, Kuehlmann, A
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.03.2011
• Subjects: Benchmark testing; Context; Delay; History; Markov processes; Optimization; Prototypes
• ISBN: 9781612842080; 1612842089
• ISSN: 1530-1591; 1558-1101
• DOI: 10.1109/DATE.2011.5763328

Modern logic synthesis systems apply a sequence of loosely-related function-preserving transformations to gradually improve the circuit with respect to certain criteria such as area, performance, power, etc. For the quality of a complete synthesis run, the application order of the transformations for the individual steps are critical as they can produce vastly different outcomes. In practice, the transformation sequences is encoded in synthesis scripts which are derived manually based on experience and intuition of the tool developer. These scripts are static in the sense that transformations are applied independently of the result of previous transformations or the current status of the design. Despite the importance of obtaining high quality scripts, there are only a few attempts to optimize them. In this paper, we present a novel method to select transformations dynamically during the synthesis run leveraging the theory of Markov Decision Processes. The decision to select a particular transformation is based on transition probabilities, the history of the applied synthesis steps, and expectations for future steps. We report experimental results obtained from an implementation of the approach using the logic synthesis system ABC.