Performance analysis of algorithms on asynchronous parallel processors
β Scribed by R.H. Barlow; D.J. Evans; J. Shanehchi
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 323 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
β¦ Synopsis
The paper will present a performance analysis of a 4-processor asynchronous parallel computer based on Texas Instruments 990/10 minicomputers, recently commissioned at Loughborough University. A description of the implementation of parallel computing on the system, which was originally 4 independent computer systems, is described elsewhere by Barlow et al.
π SIMILAR VOLUMES
We investigate and test an algorithm suitable for the parallel calculation of the potential energy of a protein, or its spatial gradient, when the protein atoms interact via pair potentials. This algorithm is similar to one previously proposed, but it is more efficient, having half the interprocesso
conditions. These conditions, which represent additional time-dependent partial differential equations, are ex-One of the great challenges in computational physics is the prediction of flow associated noise, where the quantities of interest, tremely important for successful aeroacoustic simulations.
This paper presents two parallel asynchronous algorithms for the solution of the optimal control problem of linear large-scale dynamic systems. These algorithms are based on the prediction concept. The first one adopts the interaction prediction approach and the second is based upon the costate pred
## Abstract We describe two algorithms for the parallel calculation of a CHARMmβlike force field in macromolecules. For a molecule with a given number of atoms, we show that there is an optimal number of processors leading to a minimum computation time. At the optimum, both the number of processors