Abstract
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#x2019;s implementation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
High Performance Fortran Forum: High Performance Fortran Language Specification. Technical Report, Version 2.0.delta, Rice University, October 20, 1996.
Object Management Group: The Common Object Request Broker: Architecture and Specification. Revision 2.2, February 1998. http://www.omg.org/corba/
A. Vogel, K. Duddy: Java Programming with CORBA. Wiley Computer Publishing, 1997.
JDK1. 2 Documentation. http://www.javasoft.com:80/products/jdk/1.2/docs/index.html
K. Arnold, J. Gosling: The Java Programming Language. The Java Series. Addison Wesley, Publ. Company. 1996.
Java IDL Documentation. http://www.javasoft.com/products/jdk/idl/docs.html
H. J. Sips, C. van Reeuwijk, W. Denissen: Analysis of local enumeration and storage schemes in HPF. 1996 International Conference on Supercomputing, May 1996, Philadelphia, ACM Press, 1996.
S. Chatterjee, J. R. Gilbert, F. J. E. Long, R. Schreiber, S.-H. Teng: Generating Local Addresses and Communication Sets for Data-Parallel Programs. Journal of Parallel and Distributed Computing, vol.26, pp. 72–84, 1995.
S. Benkner: Vienna Fortran 90 and its Compilation. Ph.D. thesis submitted to the Technical University of Vienna, 1994. http://www.vcpc.univie.ac.at/activities/language/Literature.html
C. Koelbel: Compile-time generation of regular communication patterns. Proceedings of Supercomputing’ 91, Albuquerque, 1991.
S. D. Kaushik, C.-H. Huang, P. Sadayappan: Efficient Index Set Generation for Compiling HPF Array Statements on Distributed Memory Machines. Journal of Parallel and Distributed Computing, vol.38, pp. 237–247, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borowiec, J. (1999). Object-Oriented Implementation of Data-Parallelism on Global Networks. In: Chatterjee, S., et al. Languages and Compilers for Parallel Computing. LCPC 1998. Lecture Notes in Computer Science, vol 1656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48319-5_8
Download citation
DOI: https://doi.org/10.1007/3-540-48319-5_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66426-0
Online ISBN: 978-3-540-48319-9
eBook Packages: Springer Book Archive