Code decomposition and recomposition for enhancing embedded software performance

ABSTRACT

Multitasking of concurrent processes implements the concurrency inherited from applications, increasing the utilization of limited resources. It requires an operating system and imposes significant runtime overhead. Serializing multitasking codes removes the need of operating system and the overhead as well. In this paper, we propose a software synthesis method to transform multitasking codes into a single process code. For this, we decompose multitasking codes into a set of code fractions and then recompose the code fractions into a single process code, preserving the functionality of the original codes. We present two different techniques for the transformation - code partitioning and code covering - and propose a hybrid technique that combines the two techniques.

REFERENCES

• 1: Alfred V. Aho , Monica S. Lam , Ravi Sethi , Jeffrey D. Ullman, Compilers: Principles, Techniques, and Tools (2nd Edition), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2006
• 2: Camposano, R. "Path-based scheduling for synthesis," IEEE transactions on CAD, pp. 85--93, Vol 10(1), 1991.
• 3: Wander O.Cesário , Damien Lyonnard , Gabriela Nicolescu , Yanick Paviot , Sungjoo Yoo , Ahmed A.Jerraya , Lovic Gauthier , Mario Diaz-Nava, Multiprocessor SoC Platforms: A Component-Based Design Approach, IEEE Design & Test, v.19 n.6, p.52-63, November 2002 [doi>10.1109/MDT.2002.1047744]
• 4: Omitted for the blind review.
• 5: Cortadella, J., Kondratyev, A., Lavagno, L., Passerone, C., and Watanebe, Y., "Quasi-static scheduling of independent tasks for reactive systems," IEEE Transactions on CAD, pp. 1492--1514, Vol. 10(10), 2005.
• 6: Stephen A. Edwards, Tutorial: Compiling concurrent languages for sequential processors, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.8 n.2, p.141-187, April 2003 [doi>10.1145/762488.762489]
• 7: Omitted for the blind review.
• 8: Bill Lin, Software synthesis of process-based concurrent programs, Proceedings of the 35th annual conference on Design automation, p.502-505, June 15-19, 1998, San Francisco, California, United States [doi>10.1145/277044.277182]
• 9: A. C. Nacul , T. Givargis, Code partitioning for synthesis of embedded applications with phantom, Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, p.190-196, November 07-11, 2004 [doi>10.1109/ICCAD.2004.1382569]
• 10: Andre C. Nacul , Tony Givargis, Lightweight Multitasking Support for Embedded Systems using the Phantom Serializing Compiler, Proceedings of the conference on Design, Automation and Test in Europe, p.742-747, March 07-11, 2005 [doi>10.1109/DATE.2005.197]
• 11: O'Brien, K., Rahmouni, M., and Jerraya, A. A., "DLS: A scheduling algorithm for high-level synthesis in VHDL," Proc. European Conference on Design Automation, pp. 393--397, 1993.
• 12: Maher Rahmouni , Ahmed A. Jerraya, Formulation and evaluation of scheduling techniques for control flow graphs, Proceedings of the conference on European design automation, p.386-391, September 18-22, 1995, Brighton, England
• 13: Daniel Weil , Valérie Bertin , Etienne Closse , Michel Poize , Patrick Venier , Jacques Pulou, Efficient compilation of ESTEREL for real-time embedded systems, Proceedings of the 2000 international conference on Compilers, architecture, and synthesis for embedded systems, p.2-8, November 17-19, 2000, San Jose, California, United States [doi>10.1145/354880.354882]
• 14: Compositional Software Synthesis of Communicating Processes, Proceedings of the 1999 IEEE International Conference on Computer Design, p.646, October 10-13, 1999
• 15: tinyOS 2.0, available in http://www.tinyos.net.