๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

CHIMP and PUL: Support for portable parallel computing

โœ Scribed by R.A.A. Bruce; S. Chapple; N.B. MacDonald; A.S. Trew; S. Trewin


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
967 KB
Volume
11
Category
Article
ISSN
0167-739X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Portability, predictability and performa
โœ Reed, Joy; Parrott, Kevin; Lanfear, Tim ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 783 KB

We report on practical experience using the Oxford BSP Library to parallelize a large electromagnetic code, the British Aerospace finite-difference time-domain code EMMA TFD3D. The Oxford BSP Library is one of the first realizations of the Bulk Synchronous Parallel computational model to be targeted

Portable parallel FFT for MIMD multiproc
โœ Averbuch, Amir; Gabber, Eran ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB

A portable parallelization of the Cooley-Tukey FFT algorithm for MIMD multiprocessors is presented. The implementation uses the virtual machine for multiprocessors (VMMP) and PVM portable software packages. Since VMMP provides the same set of services on all target machines, a single version of the

Portable tools for Fortran parallel prog
โœ Kumar, Swarn P. ;Philips, Ivor R. ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 846 KB

This paper presents a survey of some of the tools, techniques, and constructs for the development of portable, multitasked Fortran programs. The study mainly focuses on existing software tools that Implement different approaches to achieving portability of multitasked Fortran programs for local and

Runtime Support for Parallelization of D
โœ Maher Kaddoura; Sanjay Ranka ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 96 KB

In this paper we discuss the runtime support required for the parallelization of unstructured data-parallel applications on nonuniform and adaptive environments. We describe several optimization techniques for fast remapping of data and for reducing the amount of communications between machines when