Data-parallel languages allow programmers to easily express parallel computations by means of high-level constructs. To reduce overheads, the compiler partitions the computations among the processors at compile-time, on the basis of the static data distribution suggested by the programmer. When exec
A Comparison of Implicitly Parallel Multithreaded and Data-Parallel Implementations of an Ocean Model
β Scribed by Andrew Shaw; Arvind; Kyoo-Chan Cho; Christopher Hill; R.Paul Johnson; John Marshall
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 942 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A recent tendency in parallel computer design has been to use general-purpose components for system configuration elements such as CPUs, disks, and memories, which used to be specially developed. Although the connection network between the processors has been specially developed, it is now possible
has been achieved. Slight discrepancies are due to mechanical tolerances of the fabricate prototype, which was built using mechanical etching [6]. The total dimension of the filter is 35.0 mm, corresponding to 50% of the size of a conventional E-plane filter with same specifications. The upper 3-dB
An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges