Search results for "MIMD"

showing 3 items of 3 documents

Concurrent Molecular Dynamics Simulation of ST2 Water on a Transputer Array

1988

Abstract A concurrent implementation of a Molecular Dynamics program for ST2 water molecules is presented, which exploits the great potentialities of the Transputer arrays for statistical mechanical calculations. High load-balance efficiency is obtained using a new task decomposition algorithm which evenly distributes particles and interaction calculations among the processors. This approach can also help to solve efficiently the more general problem of task distribution in parallel computing of symmetric pairwise system properties.

Computer scienceGeneral Chemical EngineeringGeneral problemTransputerGeneral ChemistryParallel computingCondensed Matter PhysicsProcessor arrayMolecular dynamicsMIMDTask (computing)Modeling and SimulationDecomposition (computer science)General Materials SciencePairwise comparisonInformation SystemsMolecular Simulation
researchProduct

Use of parallel computing to improve the accuracy of calculated molecular properties

1998

Calculation of electron correlation energy in molecules is unavoidable in accurate studies of chemical reactivity. However, these calculations involve, a computational effort several, even in the simplest cases, orders of magnitude larger than the computer power nowadays available. In this work the possibility of parallelize the calculations of the electron correlation energy is studied. The formalism chosen is the dressing of matrices in both distributed and shared memory parallel systems MIMD. Algorithms developed on PVM are presented, and the results are evaluated on several platforms. These results show that the parallel techniques are useful in order to decrease very appreciably the ti…

Formalism (philosophy of mathematics)Matrix (mathematics)MIMDShared memoryElectronic correlationComputer scienceParallel computing
researchProduct

The combined distribution/assignment problem in transportation network planning: a parallel approach on hypercube architecture

1995

The joint distribution/assignment problem plays a central role in urban transport network planning. In this problem, according to the mathematical model proposed by S. P. Evans, the trips are iteratively calculated and assigned to the network in such a way that the resulting traffic flows pattern satisfies the selfish equilibrium condition. Unfortunately the number of variables and constraints increase hardly with the greatness of the networks causing long computational time for the equilibrium solution. In this paper an nCUBE 2 parallel computing architecture is employed to solve the combined problem and to asses the potential of MIMD machines to handle large scale transportation network p…

Parallel computingMIMD machinesSettore SECS-S/06 -Metodi Mat. dell'Economia e d. Scienze Attuariali e Finanz.Large scale transportation network problemDistribution/assignment problem
researchProduct