We propose to arrange a library of tree patterns into a hierarchy by means of identity operations. Compared with current unstructured approaches, our new method reduces the computational complexity of searching a pattern from O(n ˙ p) to only O(d), d ≤ p. Furthermore, the organization reveals synergies between patterns for ASIP instruction-set synthesis, data-path sharing, and code generation.
Citation:
Gero Dittmann, "Organizing Libraries of DFG Patterns," date, vol. 1, pp.10726, Design, Automation and Test in Europe Conference and Exhibition Volume I (DATE'04), 2004