Algorithm using Parallel Processing

This paper was aimed at two specific algorithms (one anal5dical and one simulation) which can be used in applications related to availability modelling of systems represented by the adjacency matrix. The following two ways of implementation of these algorithms into parallel processing were introduced ... 

Iterative solution methods are more effective for problems arising in solid mechanics and are not a common feature of the finite element modelling of polymer processes. However, under certain conditions they may provide better computer economy than direct methods. In particular, these methods have an inherent compatibility with algorithms used for parallel processing and hence are potentially more suitable for three-dimensional flow modelling. In this chapter we focus on the direct methods commonly used in flow simulation models. 

Early applications of MPC took place in the 1970s, mainly in industrial contexts, but only later MPC became a research topic. One of the first solid theoretic formulations of MPC is due to Richalet et al. [53], who proposed the so-called Model Predictive Heuristic Control (MPHC). MPHC uses a linear model, based on the impulse response and, in the presence of constraints, computes the process input via a heuristic iterative algorithm. In [23], the Dynamic Matrix Control (DMC) was introduced, which had a wide success in chemical process control both impulse and step models are used in DMC, while the process is described via a matrix of constant coefficients. In later formulations of DMC, constraints have been included in the optimization problem. Starting from the late 1980s, MPC algorithms using state-space models have been developed [38, 43], In parallel, Clarke et al. used transfer functions to formulate the so-called Generalized Predictive Control (GPC) [19-21] that turned out to be very popular in chemical process control. In the last two decades, a number of nonlinear MPC techniques has been developed [34,46, 57],... 

Computations with all of the algorithms used in conformational analysis have been greatly facilitated by continual software and hardware developments. Among these are the use of array processors145 and parallelism.146 Implementation of parallel processing is currendy a very active field. 

Higher throughput through the use of a parallel processing algorithm... 

The development of ccMBPT algorithms, which, as described in Section 2.7, effectively exploit the power of parallel processing machines, and direct techniques,39-42 which avoid the need to store the many two-electron integrals arising, has facilitated the use of the large and flexible basis sets of the universal type. 

From Eq. 6.10 it follows that the dimension n must grow at the same rate as p to maintain a constant efficiency as the number of processes increases. If n increases at the same rate as p, however, the memory requirement per process n /p + 2n) will increase with the number of processes. Thus, a fc-fold increase in p, with a concomitant increase in n to keep the efficiency constant, will lead to a fc-fold increase in the memory required per process, creating a potential memory bottleneck. Measured performance data for a parallel matrix-vector multiplication algorithm using a row-distributed matrix are presented in section 5.3.2. 

If the simulation is to be used to optimize gate and vent locations and for process control, the simulation should be completed in less than a few seconds to allow for execution of hundreds of simulations within reasonable time without the use of parallel processing or super computers. Hence development of fast fill algorithms is essential to further this approach. ... 

---