Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Superoptimizer: a look at the smallest program
ASPLOS II Proceedings of the second international conference on Architectual support for programming languages and operating systems
Compiler transformations for high-performance computing
ACM Computing Surveys (CSUR)
Exploiting hardware sharing in high-level synthesis for partial scan optimization
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Maximally fast and arbitrarily fast implementation of linear computations
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Performance optimization of sequential circuits by eliminating retiming bottlenecks
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Communications of the ACM
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Fast Prototyping of Datapath-Intensive Architectures
IEEE Design & Test
A Loop Transformation Theory and an Algorithm to Maximize Parallelism
IEEE Transactions on Parallel and Distributed Systems
Optimizing power using transformations
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A framework for estimation and minimizing energy dissipation of embedded HW/SW systems
DAC '98 Proceedings of the 35th annual Design Automation Conference
Energy-conscious HW/SW-partitioning of embedded systems: a case study on an MPEG-2 encoder
Proceedings of the 6th international workshop on Hardware/software codesign
Interface and cache power exploration for core-based embedded system design
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
A framework for estimating and minimizing energy dissipation of embedded HW/SW systems
Readings in hardware/software co-design
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Code optimization for code compression
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
PPMexe: PPM for Compressing Software
DCC '02 Proceedings of the Data Compression Conference
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Successive, well organized application of transformations has beenwidely recognized as an exceptionally effective, but complex anddifficult CAD task. We introduce a new potential-driven statisticalapproach for ordering transformations. Two new synthesis ideasare the backbone of the approach. The first idea is to quantifythe characteristics of all transformations and the relationship betweenthem based on their potential to reorganize a computationsuch that the complexity of the corresponding implementation isreduced. The second one is based on the observation that transformationsmay disable each other not only because they prevent theapplication of the other transformation, but also because both transformationstarget the same potential of the computation. These twoobservations drastically reduce the search space to find efficient andeffective scripts for ordering transformations. A key algorithmicnovelty is that both conceptual and optimization insights as well asall optimization algorithms are automatically derived by organizedexperimentation and statistical methods. On a large set of diversereal-life examples improvements in throughput, area, and power bylarge factors have been obtained. Both qualitative and quantitativestatistical analysis indicate effectiveness, high robustness, and consistencyof the new approach for ordering transformations.