Systematic architecture exploration based on optimistic cycle estimation for low energy embedded processors

ABSTRACT

Systematic architecture exploration from vast solution space is a complex problem in embedded system design. It is very difficult to explore a best architecture fast and accurately because accurate evaluation usually consumes significant amount of time for point in the solution space. In this paper, we propose fast and systematic architecture exploration method for address generation unit (AGU) based on a coarse grained reconfigurable architecture model. First we prove that a set of Pareto solutions of cycle vs energy becomes a subset of Pareto solutions of cycle vs area under some practical assumptions. In addition we propose "Optimistic cycle (OC)" metric to find out promising solutions from vast solution space. Based on this metric we also propose a fast architecture exploration algorithm which only applies mapping to promising architectures. Using the proposed systematic architecture exploration method, we show that we can obtain almost the same trade-off points as the exhaustive search method and also that our method is about 164 times faster than exhaustive search.

REFERENCES

• 1: A. Basu , R. Leupers , P. Marwedel, Register-constrained address computation in DSP programs, Proceedings of the conference on Design, automation and test in Europe, p.929-930, February 23-26, 1998, Le Palais des Congrés de Paris, France
• 2: C. Ghez, M. Miranda, A. Vandecappelle, F. Catthoor, and D. Verkest. Systematic high-level address code transformations for piecewise linear indexing: illustration on a medical imaging algorithm. In Proceedings of the IEEE Workshop on Signal Processing Systems, pages 623--632. IEEE Press, 2000.
• 3: Sumit Gupta , Miguel Miranda , Francky Catthoor , Rajesh Gupta, Analysis of high-level address code transformations for programmable processors, Proceedings of the conference on Design, automation and test in Europe, p.9-13, March 27-30, 2000, Paris, France [doi>10.1145/343647.343683]
• 4: Viktor Lapinskii, Margarida F. Jacome, and Gustavo de Veciana. Application-specific clustered vliw datapaths: Early exploration on a parameterized design space. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 21(8):889--903, August 2002.
• 5: Rainer Leupers, Retargetable Code Generation for Digital Signal Processors, Kluwer Academic Publishers, Norwell, MA, 1997
• 6: Rainer Leupers , Peter Marwedel, Algorithms for address assignment in DSP code generation, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.109-112, November 10-14, 1996, San Jose, California, United States
• 7: Clifford Liem , Pierre Paulin , Ahmed Jerraya, Address calculation for retargetable compilation and exploration of instruction-set architectures, Proceedings of the 33rd annual conference on Design automation, p.597-600, June 03-07, 1996, Las Vegas, Nevada, United States [doi>10.1145/240518.240631]
• 8: Binu Mathew , Al Davis, A loop accelerator for low power embedded VLIW processors, Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis, September 08-10, 2004, Stockholm, Sweden [doi>10.1145/1016720.1016726]
• 9: M. Miranda , M. Kaspar , F. Catthoor , H. de Man, Architectural Exploration and Optimization for Counter Based Hardware Address Generation, Proceedings of the 1997 European conference on Design and Test, p.293, March 17-20, 1997
• 10: Miguel A. Miranda , Francky V. M. Catthoor , Martin Janssen , Hugo J. De Man, High-level address optimization and synthesis techniques for data-transfer-intensive applications, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.6 n.4, p.677-686, Dec. 1998 [doi>10.1109/92.736141]
• 11: M. Palkovic , M. Miranda , K. Denolf , P. Vos , F. Catthoor, Systematic Address and Control Code Transformations for Performance Optimisation of a MPEG-4 Video Decoder, Proceedings of the 2002 conference on Asia South Pacific design automation/VLSI Design, p.547, January 07-11, 2002
• 12: Aviral Shrivastava, Sanghyun Park, Eugene Earlie, Nikil D. Dutt, Alex Nicolau, and Yunheung Paek. Automatic design space exploration of register bypasses in embedded processors. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 26(12):2102--2115, December 2007.
• 13: Greg Snider. Spacewalker: Automated design space exploration for embedded computer systems. Technical Report HPL-2001-220, HP Research Laboratories Palo Alto, September 2001.
• 14: Ashok Sudarsanam , Stan Liao , Srinivas Devadas, Analysis and evaluation of address arithmetic capabilities in custom DSP architectures, Proceedings of the 34th annual conference on Design automation, p.287-292, June 09-13, 1997, Anaheim, California, United States [doi>10.1145/266021.266103]
• 15: Guillermo Talavera , Murali Jayapala , Jordi Carrabina , Francky Catthoor, Address Generation Optimization for Embedded High-Performance Processors: A Survey, Journal of Signal Processing Systems, v.53 n.3, p.271-284, December 2008 [doi>10.1007/s11265-008-0165-y]
• 16: Ittetsu Taniguchi, Keishi Sakanushi, Kyoko Ueda, Yoshinori Takeuchi, and Masaharu Imai. Dynamic reconfigurable architecture exploration based on parameterized reconfigurable processor model. In Giovanni De Micheli, Salvador Mir, and Ricardo Reis, editors, VLSI-SoC: Research Trends in VLSI and Systems on Chip, volume 249, pages 357--376. Springer Boston, 2007.