𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Languages for vector and parallel processors

✍ Scribed by R.H. Perrott

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
800 KB
Volume
26
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

This paper first considers the major developments which have occurred in the design of high level languages for sequential machines. These developments illustrate how languages which were independent of the hardware eventually evolved. Two major types of language for vector and parallel processors have evolved, namely, detection of parallelism languages and expression of machine parallelism languages. The disadvantages and advantages of each type of language are examined. A third type of language is also considered which reflects neither the compiler's detection mechanism nor the underlying hardware. The syntax of this language enables the parallel nature of a problem to be expressed directly. The language is thus appropriate for both vector and array processors.

πŸ“œ SIMILAR VOLUMES

Makespan minimization for m parallel ide
Makespan minimization for m parallel identical processors
✍ Johnny C. Ho; Johnny S. Wong πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 803 KB

We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule. For the m identical parallel processors problem,

Protein calculations on parallel process
Protein calculations on parallel processors. II. Parallel algorithm for the forces and molecular dynamics
✍ J.F. Janak; P.C. Pattnaik πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 456 KB

## 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

Protein calculations on parallel process
Protein calculations on parallel processors. I. Parallel algorithm for the potential energy
✍ J.F. Janak; P.C. Pattnaik πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 609 KB

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