Performance and overhead analysis in runtime code modification

• Autorzy: Rudy, J.
• Języki publikacji: EN

Abstrakty

EN

Availability is a key issue for a wide array of software systems and its importance in the era of cloud computing only continues to grow.For such systems every software update or system fault means decrease in availability or loss of the system’s state and both may involve heavy cost. In order to solve these problems, the system needs to either be able to quickly recover and retrieve its previous state or have the possiblity of applying the needed changes at runtime, without the need to shut the system down. This paper proposes an experimental Versatile Code Generator tool, originally intended for simulating software, prototyping and programmable computer games,as a possible solution to aboveproblems.The tool is capable of creating Cprograms subject to runtime code modification. The main focus of this paper are performance tests, researching overhead generated by the tool. To this end, static (i.e. original) and dynamic (i.e. created by the tool) applications were compared in a number of performance factors (including compilation and execution time, memory usage, source and executable code size).Different cases, including various functions number and size, various number and types of function arguments, have been considered.

Słowa kluczowe

PL

modyfikacja kodu dynamiczna; analiza wydajności

EN

runtime software adaptation; code modification; performance analysis

• Czasopismo: Journal of Applied Computer Science
• Rocznik: 2013
• Tom: Vol. 21, nr 2
• Strony: 117--136
• Opis fizyczny: Bibliogr. 14 poz.

Twórcy

autor

Rudy, J.

• Wrocław University of Technology Institute of Computer Engineering, Control and Robotics Wybrzeże St. Wyspiańskiego 27, 50-370 Wrocław, Poland,

Bibliografia

• [1] Kniesel, G., Type-Safe Delegation for Run-Time Component Adaptation, Springer, 1999, pp. 351–366.
• [2] Pescovitz, D., Monsters in a box, Wired, 2000.
• [3] Oreizy, P., Gorlick, M. M., Taylor, R. N., Heimbigner, D., Johnson, G., Medvidovic, N., Quilici, A., Rosenblum, D. S., and Wolf, A. L., An Architecture-Based Approach to Self-Adaptive Software, IEEE Intelligent Systems, Vol. 14, No. 3, May 1999, pp. 54–62.
• [4] Zhang, J., Cheng, B. H. C., Yang, Z., and Mckinley, P. K., Enabling safe dynamic component – based software adaptation, In: in Architecting Dependable Systems III, Springer Lecture Notes for Computer Science, Springer-Verlag, 2005, pp. 194–211.
• [5] Mukhija, A. and Glinz, M., Runtime Adaptation of Applications through Dynamic Recomposition of Components, In: Proc. of 8th International Conference on Architecture of Computing Systems, 2005.
• [6] Valetto, G. and Kaiser, G., A case study in software adaptation, In: Proceedings of the first workshop on Self-healing systems, WOSS ’02, ACM, New York, NY, USA, 2002, pp. 73–78.
• [7] Garlan, D. and Schmerl, B., Model-based adaptation for self-healing systems, In: Proceedings of the first workshop on Self-healing systems, WOSS ’02, ACM, New York, NY, USA, 2002, pp. 27–32.
• [8] uwe Mätzel, K. and Schnorf, P., Dynamic Component Adaptation, Tech. rep., Union Bank of Switzerland, 1997.
• [9] Chen, H., Yu, J., Chen, R., Zang, B., and Yew, P.-C., POLUS: A POwerful Live Updating System, In: Proceedings of the 29th international conference on Software Engineering, ICSE ’07, IEEE Computer Society, Washington, DC, USA, 2007, pp. 271–281.
• [10] Bruening, D. L., Efficient, transparent, and comprehensive runtime code manipulation, Ph.D. thesis, Cambridge, MA, USA, 2004, AAI0807735.
• [11] Rudy, J., Runtime software adaptation: approaches and a programming tool, Journal of Theoretical and Applied Computer Science, Vol. 6, 2012, pp. 75– 89.
• [12] Wloka, J., Sridharan, M., and Tip, F., Refactoring for reentrancy, In: Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, ESEC/FSE ’09, ACM, New York, NY, USA, 2009, pp. 173–182.
• [13] Hughes, J., Why functional programming matters, Comput. J., Vol. 32, No. 2, April 1989, pp. 98–107.
• [14] Sondergaard, H. and Sestoft, P., Referential transparency, definiteness and unfoldability, Acta Inf., Vol. 27, No. 6, Jan. 1990, pp. 505–517.