PSO based optimization of worst-case execution time for ASIP application
-
2018-06-08 https://doi.org/10.14419/ijet.v7i2.33.14162 -
Hard Real-Time System, Embedded Controller, ASIP, Optimization, PSO, Space Exploration. -
Abstract
Industrial requires hard real-time systems for safety and critical applications like automotive, Aeronautics, manufacturing control and train industries. Hard Real-Time Systems’ embedded controllers are with expectation of complete the tasks within a certain time bounds reliably including task scheduling. The estimation of upper bound limits corresponding to the execution times is often termed as the Worst-Case Execution Times (WCETs). It is an essential step in developing and validating the hard real-time systems. Particularly, the upper bounds need to satisfy these constraints related to the execution times. However, it is often not feasible many times to set upper bounds on execution times for programs. In present work, the problem of choosing reconfigurable Custom Instructions (CIs) is accomplished by optimizing the WCET corresponding to an application. This issue is designed using Particle Swarm Optimization (PSO) based program for a path analysis. The work emphasizes on the effectiveness of optimizing the WCET when applied to a reconfigurable processor. It evaluates a compound application of multimedia with a host of reconfigurable CIs corresponding to a number of hardware parameters.
Â
Â
-
References
[1] https://ce-publications.et.tudelft.nl/author/view/id/70" target="_blank">C. Galuzzi, https://ce-publications.et.tudelft.nl/author/view/id/7" target="_blank">K.L.M. Bertels, https://ce-publications.et.tudelft.nl/publication/view/id/238" target="_blank">The Instruction-Set Extension Problem: A Survey (December 2010), ACM Transactions on Reconfigurable Technology and Systems (TRETS), volume 4, issue 2, 2010.
[2] R. Kirner and P. Puschner, “Transformation of Path Information for WCET Analysis during Compilation,†in Proc. 13thEuromicro Conference of Real-Time Systems, (ECRTS’01). IEEE Computer Society Press, Jun 2001.
[3] J. Engblom and A. Ermedahl, “Modeling Complex Flows for Worst-Case Execution Time Analysis,†in Proc. 21th IEEE Real-Time Systems Symposium (RTSS’00), Nov 2000.
[4] C. Ferdinand, F. Martin, and R. Wilhelm, “Applying Compiler Techniques to Cache Behavior Prediction,†in Proc. ACM SIGPLAN Workshop on Languages, Compilers and Tools for Real-Time Systems (LCT-RTS’97), 1997.
[5] Y.-T. S. Li and S. Malik, “Performance Analysis of Embedded Software Using Implicit Path Enumeration,†in Proc. Of the 32: nd Design Automation Conference, 1995, pp. 456–461.
[6] J. Gustafsson, B. Lisper, C. Sandberg, and N. Bermudo, “A Tool for Automatic Flow Analysis of C-programs for WCET Calculation,†in 8th IEEE International Workshop on Object-oriented Real-time Dependable Systems (WORDS’03), Jan 2003.
[7] C. Healy, R. Arnold, F. M¨uller, D. Whalley, and M. Harmon, “Bounding Pipeline and Instruction Cache Performance,†IEEE Transactions on Computers, vol. 48, no. 1, Jan 1999.
[8] N. Holsti, T. L°angbacka, and S. Saarinen, “Worst-Case Execution-Time Analysis for Digital Signal Processors,†in Proceedings of the EUSIPCO 2000 Conference (X European Signal Processing Conference), Sep 2000.
[9] T. Lundqvist and P. Stenstr¨om, “An Integrated Path and Timing Analysis Method based on Cycle-Level Symbolic Execution,†Journal of Real-Time Systems, May 2000.
[10] F. Stappert and P. Altenbernd, “Complete Worst-Case Execution Time Analysis of Straight-line Hard Real-Time Programs,†Journal of Systems Architecture, vol. 46, no. 4, pp. 339–355, 2000.
[11] R. Heckmann, M. Langenbach, S. Thesing, and R. Wilhelm, “The Influence of Processor Architecture on the Design and the Results of WCET Tools,†IEEE Proceedings on Real-Time Systems, 2003.
[12] S.-S. Lim, Y. H. Bae, C. T. Jang, B.-D. Rhee, S. L. Min, C. Y. Park, H. Shin, K. Park, and C. S. Ki, “An Accurate Worst-Case Timing Analysis for RISC Processors,†IEEE Transactions on Software Engineering, vol. 21, no. 7, pp. 593–604, Jul 1995.
[13] S.-K. Kim, S. L. Min, and R. Ha, “Efficient Worst Case Timing Analysis of Data Caching,†in Proc. 2nd IEEE Real-Time Technology and Applications Symposium (RTAS’96). IEEE, 1996, pp. 230–240.
[14] R. White, F. M¨uller, C. Healy, D. Whalley, and M. Harmon, “Timing Analysis for Data Caches and Set-Associative Caches,†in Proc. 3rd IEEE Real-Time Technology and Applications Symposium (RTAS’97), Jun 1997, pp. 192–202.
[15] A. Colin and I. Puaut, “Worst Case Execution Time Analysis for a Processor with Branch Prediction,†Journal of Real-Time Systems, vol. 18, no. 2/3, pp. 249–274, May 2000.
[16] T. Mitra and A. Roychoudhury, “Effects of Branch Prediction on Worst Case Execution Time of Programs,†National University of Singapore (NUS), Tech. Rep. 11-01, Nov 2001.
[17] Falk, H., Plazar, S., &Theiling, H. (2007, September). Compile-time decided instruction cache locking using worst-case execution paths. In Proceedings of the fifth IEEE/ACM international conference on Hardware/software codesign and system synthesis (pp. 143-148), 2007. ACM.
[18] Liu, T., Li, M., &Xue, C. J. (2009, April). Minimizing WCET for real-time embedded systems via static instruction cache locking. In Real-Time and Embedded Technology and Applications Symposium, 2009. RTAS 2009. 15th IEEE (pp. 35-44), 2009. IEEE.
[19] Mitra, T., & Yu, P. (2005, September). Satisfying real-time constraints with custom instructions. In Hardware/Software Codesign and System Synthesis, 2005. CODES+ ISSS'05. Third IEEE/ACM/IFIP International Conference on (pp. 166-171). IEEE.
[20] Kennedy, J. (2011). Particle swarm optimization. In Encyclopedia of machine learning (pp. 760-766). Springer US, 2011.
-
Downloads
-
How to Cite
Venkanna, M., Rao, R., & Chandra Sekhar, P. (2018). PSO based optimization of worst-case execution time for ASIP application. International Journal of Engineering & Technology, 7(2.33), 252-254. https://doi.org/10.14419/ijet.v7i2.33.14162Received date: 2018-06-17
Accepted date: 2018-06-17
Published date: 2018-06-08