Compile-time generation of regular communications patterns
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Generating local addresses and communication sets for data-parallel programs
Journal of Parallel and Distributed Computing
Analysis of local enumeration and storage schemes in HPF
ICS '96 Proceedings of the 10th international conference on Supercomputing
Efficient index set generation for compiling HPF array statements on distributed-memory machines
Journal of Parallel and Distributed Computing - Special issue on compilation techniques for distributed memory systems
Java programming with CORBA
The Java Programming Language
| Hi-index | 0.00 |
An alternative approach to the SPMD implementation of data parallelism is described. In this approach, the data-parallel program is executed on a collection of processors that can be located anywhere on a global network. On each of these processors a server is installed that hosts one or more servants - objects intended for performing parallel operations. One of the servers, the conductor, plays a special role: it executes the whole program except for operations on mapped arrays; to execute such operations, the conductor employs the servants mentioned above. The conductor executes on a chosen processor, the host. In addition to the parallel execution model, a framework is described that makes possible experiments with remotely executed data-parallel programs. This framework combines a High Performance Fortran (HPF) subset with the infrastructure of CORBA. It is implemented in Java. Occasionally, we quote the kernel of the algorithm generating communication sets, which was designed for the framework's implementation.