Designing, Implement And Application Of Distributed Parallel Computing Environment MPIBD

With the enhancing demand to the performance of computer, parallel computing is developing rapidly. In recent years, the distributed parallel computing is becoming a new trend. The method of message passing is widely used in some parallel computers, especially in distributed memory parallel computers. In the distributed computing based on message passing, MPI is a popular message passing interface library in parallel programming. The committee of the MPI Forum defines a set of standard interface library which makes MPI to achieve the best performance.MPI library provides the description using C and Fortran, which is named as C binding and Fortran binding respectively. Popular realizations of MPI standard are CHIMP and LAM and so on. Delphi is an excellent object-oriented tool for rapid development of applied programming. If we bind Delphi with MPI so that MPI can support Delphi, MPI will have wider application foreground. MPIBD(Message Passing Interface Binding Delphi) presented in this paper is a distributed parallel computing environment constructed on the MPI-communication-library bound with Delphi. One of the important feature of MPIBD is the communicator, which allows the programmer to define unique communication space within a set of processes that can communicate each other. In the space, we provide a message passing method of node-to-node, each of which runs on Windows X operating system and uses TCP/IP protocol as its basic communication protocol. In this paper, we first analyze MPI standard, and then illustrate the designing of MPIBD communication library and the structure of MPIBD Distributed Parallel Computing Environment. Some key techniques in the development of MPIBD are also presented.In order to analyze the usability and validity of MPIBD Distributed Parallel Computing Environment, we choose the problem of "Latin square searching" as an instance to test MPIBD, since the problem requires a large amount of computation and has potentially high parallelism. Noticing that the Latin square can be listed in a particular order, we can follow this order to search for all the Latin Squares. Since arithmetic operations of large magnitude integers can not be carried out directly, a setof subroutines for large magnitude integer arithmetic operations are developed by characterizing the large integers. We present a parallel algorithm of searching standard Latin square and develop its parallel program using MPIBD. The experimental results are also given. At last, we analyze the system performance and prospect the further development of our system.