RUS | UKR | ENG || DonNTU > Master's portal
Masters of Donetsk National Technical University Morozov Roman

Morozov Roman


Theme of master's work:

Portioned algorithms of solving of the problems of high dimensionality on computing claster

Scientific adviser:Cond. of Scl(Eng) Ladyzhenskiy Yuriy


Materials on the theme of master's work: About author

Master's work

Introduction

        Presently one of the most difficult tasks in is the world consider the decision of capacious tasks. It is such tasks, when a necessity is for the decision of thorny calculable problem, for example, decision of the system from 1000 equalizations, conducting of the calculations related to it, comparisons and sorting, neither the clusters of balancing of loading nor clusters of high availability will not help here. For the decision of similar tasks is used the separate type of clusters, which is named calculable or academic.

        Calculable clusters (High Performance Computing Cluster) provide the increase of the productivity of having a special purpose applications, if functions of these applications — capacious calculations. Growth of the productivity is straight related to distributing of one calculable process on all accessible sites of cluster.

Actuality of the subject

        Research of parallel much-net method of Fedorenko on the calculable cluster of Microsoft Windows Compute Cluster Server 2003 is topically, because such researches were not conducted yet.

Purpose and tasks of development and research

Purpose of the work

       The purpose of work is development and realization of the programmatic system, allowing to get the decision of differential equalizations in private derivatives by a much-net method on a calculable cluster.

Basic tasks of development and research

The main tasks of researches is:

Article of development and research

The article of researches are technologies of parallel decision of equalizations in private derivatives on the calculable cluster of Microsoft Windows Compute Cluster Server 2003 with the use of much-net methods.

Novelty is scientific

These researches are executed first in the indicated terms.

Practical value of the got results

The use of the programmatic system will allow to estimate a fast-acting and exactness of decision of differential equalizations a parallel method on a calculable cluster. The programmatic system can be used for the parallel decision of differential equalizations in private derivatives a much-net method.

Approbation of the work

On results the executed researches an author is do a lecture, at international scientific and technical conference of "Information science and computer technologies" of May, 12-15 2009 taking place in Donetsk in Donetsk National Technical University.

Basic maintenance of work

        Differential equalizations in private derivatives are the widely applied mathematical vehicle at development of models in the most different areas of science and technique.

        One of the most effective way to decision of differential equalizations in private derivatives is much-net approach. Decision is made at first on a rough(large) net, and then carried on more shallow net. It is main feature of this method. Initial decision for the net of NXN, where N – amount of sites, built by means of approximating net (N/2) of x(N/2), got saving of every second site of initial net of NXN. More rough net (N/2) of kh(N/2), in same queue, is approximated the net (N/4) of kh(N/4) et cetera. Then in a private area an error appears as a sum of sinusoid with different frequencies. Then work, executable on a concrete net, diminishes a half frequency component of error, for which diminishing was not attained on more rough nets. Therefore work, producible for decision in every site of net, does a close decision more smooth, that equivalently to suppression high-frequency component of error.

        We will consider the close algorithm of decision on net equalization of Puassona:

       We will consider net equalization of Puassona on the 5-point template of differential chart "cross":

Формула1

and, in addition, equalization

Формула2

where

Формула3

Формула4

h – step on co-ordinates,

u – scope terms,

r — discrepancy,

e — error of decision

If the close decision of the first task is known, deciding the second, it will be possible to find the decision of the initial system on a formula Формула4,

but the decision of task (2) such is exact on complication, as well as decision of initial task.

If you apply an iteration method to the first equalization, doing a few iterations, the close decision of task will be known, and discrepancy will become a fluently changing function. Discrepancy will be well presented on more rough net, then the dimension of the auxiliary system of the second equalization will fall down.

Algorithm:

  1. We do a few iterations, for finding of decision, calculate discrepancy

    Формула4

    on a shallow net.
  2. On a large net decide the special equalization (2) for discrepancy in points, consilient with the points of shallow net.
  3. Interpolation of discrepancy is executed on the sites of shallow net.
  4. Passing to the point 1.

The example of realization of much-net method on three nets is resulted on an animation picture

Реализации много сеточного метода

Picture 1. Much-net method on three nets

Denotations of the example resulted on the animated picture:

h – step of net(distance between two nearby sites).

стрелки - it is a decision of the got equalizations.

стрелки - it is interpolation of the got values on more shallow net.

стрелки - it is a transfer, got at a decision, values on more large (shallow) net.

Description of the example resulted on the animated picture:

  1. We do a few iterations on the shallow net of h.
  2. We carry discrepancy on more rough net.
  3. We decide on a net 2h equalization for discrepancy.
  4. On the net of 2h carry got discrepancy on the net of 4h.
  5. We decide the got equalizations.
  6. We carry the got values on more shallow net.
  7. We interpolate values on more shallow net.
  8. We decide the got equalizations on the net of 2h.
  9. We carry the got values on a net with the step of h.
  10. We interpolate the got values.
  11. We decide the got equalizations on the net of h.

For realization of much-net methods on a calculable cluster it is possible to use a few typical topology connections:

Subsystem

For comfortable realization of the programmatic system of decision of much-net methods it is necessary to use object-aligned approach. The system contains a few associate subsystems. Subsystems are resulted on a picture 7.

Subsystem

Picture 7. Subsystem of programmatic system

Subsystem of input of information – is intended for the input of information, necessary for a decision.

Subsystem of processing of data:

Structures in which will be kept basic, intermediate and resulting data are formed.

Subsystem of parallel calculations:

This subsystem is responsible directly for realization of parallel much-net method for the decision of differential equalizations.

Balancing of the calculable loading supposes the even loading of calculable sites. Subsystem of output of results –is responsible for comfortable for a study presentation of the got results.

Such structure provides a management data, got on every iteration in the process of decision of task.

Conclusion

The use of the programmatic system will allow to estimate efficiency and exactness of parallel decision of tasks in private derivatives by a much-net method.

List of the used literature

  1. Гергель В.П. Теория и практика параллельных вычислений. – СПб.: Бином, 2007. – 424с.: ил.
  2. Шпаковский Г.И. Программирование для многопроцессорных систем в стандарте MPI. – СПб.: Минск, 2002. – 323с.: ил.
  3. Антонов А.С. Введение в параллельные вычисления. – СПб.: Москва, 2002. – 69с.: ил.
  4. Федоренко Р. П. Введение в вычислительную физику: Учеб. Пособие: Для вузов. — М.: Изд-во Моск. Физ.-техн. Ин-та, 1994. — 528 с.
  5. Hackbusch V., Trottenberg U. Multigrid Methods. - Lecture Notes in Math. 960, Springer Verlag, 1982., Сайт - http://torrents.ru/forum/viewtopic.php?t=1500630
  6. Бахвалов Н.С. Численные методы – Изд.:Лаборатория Базовых Знаний, 2003.– 632 с.
  7. Забродин А.В., Луцкий А.Е. Параллельные вычисления при решении современных задач науки и техники, Сайт - http://compmech.math.msu.su/kaf_paral.php
  8. Windows HPC Server 2008 , Сайт - http://www.microsoft.com/windowsserver2003/ccs/
  9. PCWeek Review №3 (3) 2008 , Сайт - http://pcweek.com.ua
  10. Лобанов А.И., Петров И.Б. Численное решение уравнений в частных производных эллиптического типа на примере уравнений Лапласа и Пуассона [Электронная лекция], Сайт - http://www.intuit.ru/department/calculate/nmdiffeq/6

ДонНТУ > Портал магистров ДонНТУ >|| Автореферат | Библиотека | Автобиография | Ссылки | Отчет о поиске | Индивидуальное задание