Computing Simulation in Orders Based Transparent Parallelizing. Vitalij Pavlenko, Viktor Burdeinyi

Abstract. This paper is devoted to the problem of analysis of time characteristics of execution of parallel program that use orders based transparent parallelizing technology. A new approach that combines profiling and asymptoti execution time analysis is being proposed. It is split into a set of stages, making it possible to repeat only some of th stages if the input data of the program, cluster configuration or scheduling algorithm changes. The proposed method can be used for estimating program execution time, finding and eliminating bottlenecks, estimating the power of cluste needed to execute the program within given time limit.

Keywords. Parallel computing, clusters, orders based transparent parallelizing, profiling, asymptotic analysis.

References.

1. Ivakhnenko A. G.: The Group Method of Data Handling in Long-Range Forecasting, Technological Forecasting and Social Change, 12, 2/3:213-227, 1978.

2. Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, Charles E. Leiserson: Introduction to Algorithms, McGraw-Hill Higher Education, 2001.

3. Voyevodin V.V., Voyevodin Vl.V.: Parallel Computations [in Russian], BHV, St. Petersburg, 2002.

4. Pavlenko V.D., Burdejnyj V.V.: Cluster Computing Using Orders Based Transparent Parallelizing –

Information Systems Technology and its Applications, Proceedings 6th International Conference ISTA’2007, May 23–25, 2007, Kharkiv, Ukraine. – Lecture Notes in Informatics (LNI), Series of the Gesellschaft fur Informatik (GI), Vol. P–107: 152-163, Bonn 2007.