Foster, I. 1992. \Information Hiding in Parallel Programs", Tech. Report MCSP290 -0292, Argonne National Lab.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....that is an object of type task initialized to the value 23. Note that the operator can be overloaded, eliminating the need for an application program to ever refer directly to a processor object. This provides a flexible, user defined scheme for addressing logical processors (for examples, see [Fos92] Examples of how a user might view logical processor ids include an integer, a pair of integers (if the logical processors form a two dimensional mesh) or an enumerated type. Logical Processors and Physical Processors In addition to providing an argument to the initialization function (i.e. ....

Ian Foster. Information hiding in parallel programs. Technical Report MCS-P290-0292, Argonne National Laboratory, 1992.

....separation of implementations of object and coordination constraints in order to define a distributed coordination structure. However, the focus here is on re usability of object and coordination constraints, and not on the modifiability and extensibility of concurrent programs in general. Foster [8] also introduces the notion of separation of implementations of architectural elements from task implementations in order to support re usability of implementations of the architectural specifications, and portability of concurrent programs. However, in the proposed approach, specifications of ....

Ian T. Foster. Information Hiding in Parallel Programs. Technical Report MCSP290 -0292, Argonne National laboratory, 1992.

.... variables and defines how these ideas interact with conventional sequential constructs [1, 6] The PCN system also incorporates two additional constructs virtual topologies and port arrays that allow the definition and reuse of parallel program structures called cells and templates [4]. Our description of the PCN language is divided into five parts. These describe in turn the constructs used to specify concurrency, communication and synchronization, nondeterminism, mapping, and composition of process ensembles. 3.1 Concurrency Syntax is similar to that of the C programming ....

.... to the reuse of parallel code is based on what we term a software cell: a set of processes created within a virtual topology to perform some distinct function such as a reduction or a mesh computation, and provided with one or more port arrays for communication with other program components [4]. We have already seen several examples of cells: for instance, the procedure ring in the preceding section implements a cell that performs ring pipeline computations. The interface to a PCN cell consists simply of the port arrays and definitional variables that are its arguments. A cell ....

[Article contains additional citation context not shown here]

Foster, I., Information hiding in parallel programs, Preprint MCS-P290-0292, Argonne National Laboratory, 1992.

No context found.

Foster, I. 1992. \Information Hiding in Parallel Programs", Tech. Report MCSP290 -0292, Argonne National Lab.

No context found.

Foster, I. 1992. \Information Hiding in Parallel Programs", Tech. Report MCSP290 -0292, Argonne National Lab.

No context found.

Ian T. Foster, Information Hiding in Parallel Programs, Technical Report MCS-P2900292, Argonne National Laboratory (1992).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC