E. Laure, M. Haines, P. Mehrotra, and H. Zima. On the Implementation of the Opus Coordination Language. Concurrency: Practice and Experience, 12(4):227-249, April 2000. 16 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A High Performance Decomposition Solver for Portfolio.. - Laure, Moritsch (2001) Self-citation (Laure) (Correct)
No context found.
E. Laure, M. Haines, P. Mehrotra, and H. Zima. On the Implementation of the Opus Coordination Language. Concurrency: Practice and Experience, 12(4):227-249, April 2000. 16
High Level Support for Distributed High Performance Computing - Laure (2001) Self-citation (Laure Haines Mehrotra Zima) (Correct)
....we presume some basic knowledge of Fortran 90, HPF, and Java. 5. 2 Implementing the Coordination Language Opus In this section we describe the design of a system that efficiently implements the Coordination Language Opus (or simply Opus in the following) i.e. the HPF binding of Opus (see also [130, 131]) We provide an overview of the whole system, ranging from the basic supporting systems up to the high level compiler component. We focus specifically on the task parallel features of Opus. The data parallel (HPF) portion is left to be handled by an existing HPF compilation system (such as the ....
E. Laure, M. Haines, P. Mehrotra, and H. Zima. On the Implementation of the Opus Coordination Language. Concurrency: Practice and Experience, 12(4):227--249, April 2000.
HPF in Financial Management Under Uncertainty - Laure, Sipkova, Mehofer.. (1999) Self-citation (Laure) (Correct)
No context found.
E. Laure, M. Haines, P. Mehrotra, and H. Zima. On the Implementation of the Opus Coordination Language. Concurrency: Practice and Experience, in print 1999. also available as: TR99-03, Institute for Software Technology and Parallel Systems.
Distributed High Performance Computing With Opusjava - Laure (1999) Self-citation (Laure) (Correct)
No context found.
E. Laure, M. Haines, P. Mehrotra, and H. Zima. On the Implementation of the Opus Coordination Language. Concurrency: Practice and Experience, in print 1999.
OpusJava - A Java Framework for Distributed High Performance.. - Laure (2000) (1 citation) Self-citation (Laure) (Correct)
....over heterogeneous platforms. We 12 present both, the Java framework as well as its interface to Opus and report on first experiences we gained with a prototype implementation at the end of the section. 6. 1 Implementation Design of Opus Recently, an implementation effort for Opus was initiated [22]. One of the main design goals, apart from having an efficient and portable implementation, was the integration with the Vienna Fortran Compiler (VFC) 1] so that we do not have to re implement any of the HPF compiler work. Moreover, we re use low level runtime components like thread and ....
....the code into blocks of HPF code with calls to the Opus Runtime System (ORS ) The resulting code is further processed by VFC which produces Fortran 90 code with calls to the VFC runtime system. This code is eventually compiled and linked with both the VFC runtime system and the ORS. The ORS [22] provides runtime representations for SDAs and method invocation requests (MIs) as well as higher abstractions of low level system components (such as pthreads [17] and MPI [24] Moreover, methods for buffering MIs on the callee side, which is due to the conditional execution of methods, are ....
[Article contains additional citation context not shown here]
E. Laure, M. Haines, P. Mehrotra, and H. Zima. On the Implementation of the Opus Coordination Language. Concurrency: Practice and Experience, in print 1999. also available as: TR99-03, Institute for Software Technology and Parallel Systems.
ParBlocks - A new Methodology for Specifying Concurrent Method.. - Laure (1999) Self-citation (Laure) (Correct)
....at depth 2 whose father at depth 1 is a par section again. Consequently, all elements belonging to this par section are added to P e resulting in the set ff; a; b; cg. Since the father of this par section is the root node, our algorithm terminates for this set. 5. 2 Runtime Support In [9] we discuss in detail the compilation and runtime support for Opus. The main concept is that an SDA is compiled into an active object consisting of two threads: a server thread responsible for retrieving incoming request and storing them in a shared memory area (consisting of Method Invocation ....
E. Laure, M. Haines, P. Mehrotra, and H. Zima. On the Implementation of the Opus Coordination Language. Concurreny: Practice and Experience, to appear 1999.
A Run-time System for SCOOP - Michael Compton Csiro (2002) (1 citation) (Correct)
No context found.
Erwin Laure, Matthew Haines, Piyush Mehtrotra, and Hans Zima. On the Implementation of the Opus Coordination Language. Parallel Processing Letters, 9(2): 275--289, June 1999.
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