Jade is a data-oriented language for parallelizing programs written in a serial, imperative programming language such as C, FORTRAN, or C++. A Jade programmer simply augments the program with assertions specifying how the program accesses data. The Jade implementation dynamically interprets these assertions to execute the program concurrently while enforcing the program's data dependence constr...

We are researching techniques for programming large-scale parallel machin,es for scientiJc com.putation. We use an intermediate-level language, MetaMP, that sits between High Performance Fortran (HPF) and low-level message passing. We are developing an efficient set of primitives in the intermediate language and we are investigating compilation methods that can semi-automatically reason about p...

OpenMP is a set of directives extending Fortran and C which provide a shared memory programming interface for shared-address space machines. However, there are no directives for controlling the locality of data. Such control can critically affect performance on machines which exhibit non-uniform memory access times. In this paper, we present a set of extensions to OpenMP to provide support for ...

EEcient task migration is an important feature in parallel and distributed programs, in particular to support checkpointing and recovery for fault tolerance. It is also very useful in distributed environments like networks of workstations where external loads are often unpredictable and dynamic in nature. We propose simple language extensions (ELMO) to existing sequential programming languages ...

Several parallel programming languages, libraries and environments have been developed to ease the task of writing programs for multiprocessors. Proponents of each approach often point out various language features that are designed to provide the programmer with a simple programming interface. However, virtually no data exist that quantitatively evaluates the relative ease of use of different ...

Multiphysics and multiscale simulation systems share a common software requirement—infrastructure to implement data exchanges between their constituent parts—often called the coupling problem. On distributed-memory parallel platforms, the coupling problem is complicated by the need to describe, transfer, and transform distributed data—known as the parallel coupling problem. Parallel coupling is...

Here, we present simple and efficient numerical scheme to study static dynamic properties of spin-1 Bose–Einstein condensates (BECs) with spin–orbit (SO) coupling by solving three coupled Gross–Pitaevskii equations (CGPEs) in three-, quasi-two quasi-one dimensional systems. We provide a set codes developed FORTRAN 90/95 programming language user defined ‘option’ imaginary real-time propagation....

Several parallel programming languages, libraries and environments have been developed to ease the task of writing programs for multiprocessors. Proponents of each approach often point out various language features that are designed to provide the programmer with a simple programming interface. However, virtually no data exists that quantitatively evaluates the relative ease of use of different...

Automatic differentiation is a technique for the rule-based transformation of a subprogram that computes some mathematical function into a subprogram that computes the derivatives of that function. Automatic differentiation algorithms are typically expressed as operating on a weighted term graph called a linearized computational graph. Constructing this weighted term graph for imperative progra...

Although Fortran is not a pleasant language to use, it does have the advantages of universality and (usually) relative efficiency. The Ratfor language attempts to conceal the main deficiencies of Fortran while retaining its desirable qualities, by providing decent control flow statements: statement grouping if-else and switch for decision-making while, for, do, and repeat-until for looping brea...