Parallel operators

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Encapsulating parallelism and synchronization code within object-oriented software components is a promising avenue towards mastering the complexity of the distributed memory supercomputer programming. However, in trying to give application programmers benefit of supercomputer power, the library designer generally resorts to low level parallel constructs, a time consuming and error prone process. To solve this problem we introduce a new abstraction called Parallel Operators. A Parallel Operator exists simultaneously on all processors involved in a distributed computation: it acts as a single ubiquitous entity capable of processing shared or distributed data in parallel. In this paper we reify this concept in our Eiffel Parallel Execution Environment (EPEE) context, and we show that it is both natural and efficient to express computations over large shared or distributed data structures using Parallel Operators. We illustrate our approach with a Parallel Operator based solution for the well-known N-body problem.

Cite

CITATION STYLE

APA

Jézéquel, J. M., & Pacherie, J. L. (1996). Parallel operators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1098, pp. 275–294). Springer Verlag. https://doi.org/10.1007/bfb0053066

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free