Transforming Source Code to Mathematical Relations for Performance Evaluation

• Autorzy: Izadkhah H.

Identyfikatory

DOI

10.1515/umcsinfo-2015-0005

• Języki publikacji: EN

Abstrakty

EN

Assessing software quality attributes (such as performance, reliability, and security) from source code is of the utmost importance. The performance of a software system can be improved by its parallel and distributed execution. The aim of the parallel and distributed execution is to speed up by providing the maximum possible concurrency in executing the distributed segments. It is a well known fact that distributing a program cannot be always caused speeding up the execution of it; in some cases, this distribution can have negative effects on the running time of the program. Therefore, before distributing a source code, it should be specified whether its distribution could cause maximum possible concurrency or not. The existing methods and tools cannot achieve this aim from the source code. In this paper, we propose a mathematical relationship for object oriented programs that statically analyze the program by verifying the type of synchronous and asynchronous calls inside the source code. Then, we model the invocations of the software methods by Discrete Time Markov Chains (DTMC). Using the properties of DTMC and the proposed mathematical relationship, we will determine whether or not the source code can be distributed on homogeneous processors. The experimental results showed that we can specify whether the program is distributable or not, before deploying it on the distributed systems.

Słowa kluczowe

EN

distributed software systems; source code; speed up; Discrete Time Markov Chains

• Wydawca: Wydawnictwo UMCS
• Czasopismo: Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
• Rocznik: 2015
• Tom: Vol. 15, no. 2
• Strony: 7--13
• Opis fizyczny: Bibliogr. 20 poz., rys., tab.

Twórcy

autor

Izadkhah H.

• Department of Computer Science, Faculty of Mathematical Sciences, University of Tabriz Tabriz, Iran

Bibliografia

• [1] J. AL-Jaroodi, N. Mahamad, H. Jiang, D. Swanson, "JOPI: a Java object passing interface", Concurrency Comput. Pract. Exp., Volume 17, pp. 775-795, 2005.
• [2] S. Parsa, and V. Khalilpoor, "Automatic Distribution of Sequential Code Using JavaSymphony Middleware", SOFSEM 2006, LNCS 3831, pp. 440 - 450, 2006.
• [3] L. S. Georgios, and D. K. Helen, "Scheduling multiple task graphs in heterogeneous distributed real-time systems by exploiting schedule holes with bin packing techniques", Simulation Modelling Practice and Theory, Volume 19, Issue 1, pp. 540-552, 2011.
• [4] D. Thain, T. Tannenbaum, and M. Livny, "Distributed Computing in Practice: The Condor Experience", Concurrency and Computation: Practice and Experience, Volume 17, No. 2-4, pp. 323-356, 2005.
• [5] W. Gentzsch, "Sun Grid Engine: towards creating a compute power grid Cluster", Proceedings. First IEEE/ACM International Symposium on Cluster Computing and the Grid, pp. 35-36, 2001.
• [6] B. Nitzberg, J. M. Schopf, J. P. Jones, "PBS Pro: Grid computing and scheduling attributes Grid resource management", pp. 183 - 190, 2004, Kluwer Academic Publishers Norwell, MA, USA.
• [7] S. Zhou, J. Wang, X. Zheng, P. Delisle, "Utopia: A Load Sharing Facility for Large, Heterogeneous Distributed Computer Systems", Software-Practice & Experience Volume 23 Issue 12, pp. 1305 - 1336, 1993.
• [8] F. Berman, "Adaptive computing on the Grid using AppLeS, Parallel and Distributed Systems", IEEE Transactions on, Volume 14 , Issue 4 pp. 369 - 382, 2003.
• [9] F. Berman, "New grid scheduling and rescheduling methods in the GrADS project", International Journal of Parallel Programming - Special issue: The next generation software program archive, Volume 33, Issue 2, pp. 209 - 229, 2005.
• [10] Oriented Grid and Utility Computing (Wiley Series on Parallel and Distributed Computing), Editors Rajkumar Buyya and Kris Bubendorfer, ISBN-13: 978-0470287682.
• [11] O. Bushehrian, "Automatic actor-based program partitioning", Journal of Zhejiang University-SCIENCE C (Computers & Electronics), 11(1), pp 45-55, 2010. [doi: 10.1631/jzus.C0910096]
• [12] A. Isazadeh, J. Karimpour, I. Elgedawy, H. Izadkhah, "An Analytical Model for Source Code Distributability Verification", Springer Journal of Zhejiang University-SCIENCE C, Vol. 15, Issue 2, pp 126-138, 2014.
• [13] A. Isazadeh, I. Elgedawy, J. Karimpour, H. Izadkhah, "An Analytical Security Model for Existing Software Systems", to appear in Applied Mathematics & Information Science, Vol. 8, Issue 2, pp 691-702, 2014.
• [14] U. N. Bhat, "Elements of Applied Stochastic Processes", second ed. John Wiley & Sons, Inc, 1984.
• [15] K. S. Trivedi, "Probability and Statistics with Reliability, Queuing and Computer Science Applications", John Wiley and Sons, 2001.
• [16] M. Schoeberl, "A time predictable Java processor", Proc. Conf. Design, Automation and Test in Europe, Germany, pp. 800-805, 2006
• [17] C. A. Healy, M. Sjodin, D. B. Whalley, "Bounding loop iterations for timing analysis", Proc. IEEE Real-Time Technology and Applications Symp., pp. 12-21, 1998.
• [18] R. Maani, S. Parsa, "An Algorithm to Improve Parallelism in Distributes Systems Using Asynchronous Calls", 7th Int. Conf. on Parallel Processing and Applied Math, p.312-317, 2007.
• [19] T. Fahringer, A. Jugravu, "JavaSymphony: new directives to control and synchronize locality, parallelism, and load balancing for cluster and GRID-computing", Proc. Joint ACM Java Grande - ISCOPE 2002 Conf., Seattle, Washington.
• [20] P. A. Jensen and J. F. Bard, "Operations Research Models and Methods", published by John Wiley and Sons, 2003.