Parallel computations are used in many areas where large computation amounts are required and/or faster response is critical. The development of parallel algorithms and parallel programming are complicated and require additional knowledge. To ease the parallel programming and algorithm parallelization many tools are developed. One class of such tools is algorithm templates. The idea of algorithm templates is to separate the problem specific and general parts of the algorithm. The general part can be implemented as a reusable module. The problem specific part of the algorithm should be implemented by the user. When these ideas are used for parallel programming, the template has to specify the main parts of the parallel algorithm: partitioning, communications, mapping, synchronization. Master – slave algorithms are very popular and widely used in parallel programming. It is efficient both for homogeneous and heterogeneous parallel computers. Parallelization tools of master – slave algorithms using popular communication libraries are useful. Many problems of engineering, economics and other fields are formulated as optimization problems. Optimization problems are often complicated and computation intensive. Therefore the creation of automatic parallelization tools of popular branch and bound optimization algorithms is relevant. Grillage type foundations are popular in case of weak grounds. It consists of beams that are supported by piles or reside on other beams. In order to... [to full text]