Results 1 -
3 of
3
Coarse-Grain Parallel Programming in Jade
, 1991
"... This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and run-time system use this inf ..."
Abstract
-
Cited by 46 (4 self)
- Add to MetaCart
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those sections of code to be parallelized with abstract data usage information. The compiler and run-time system use this information to concurrently execute the program while respecting the program's data dependence constraints. Using Jade can significantly reduce the time and effort required to develop and maintain a parallel version of an imperative application with serial semantics. The paper introduces the basic principles of the language, compares Jade with other existing languages, and presents the performance of a sparse matrix Cholesky factorization algorithm implemented in Jade.
Performance Analysis of a Large-Grain Dataflow Scheduling Paradigm
, 1993
"... This paper describes and analyzes a paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Man ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
This paper describes and analyzes a paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital signal processing. With the advent of computer-aided software engineering (CASE) tools for capturing software designs in dataflow-like structures, macrodataflow scheduling becomes increasingly attractive, if not necessary. For parallel implementations, using the macro-dataflow method allows the scheduling to be insulated from the application designer and enables the maximum utilization of available resources. Further, by allowing multitasking, processor utilizations can approach 100 percent while they maintain maximum speedup. Extensive simulation studies are performed on 4-, 8-, and 16-processo...
A Visual Programming Environment for the Navier-Stokes Computer
"... The Navier-Stokes Computer is a high-performance, reconfigurable, pipelined macliiiie designed to solve large coinputatioiial fluid dynamics problems. Due to the complexity of the architecture, devel-opment of effective high-level language compilers for the system appears to be a very difficult task ..."
Abstract
- Add to MetaCart
The Navier-Stokes Computer is a high-performance, reconfigurable, pipelined macliiiie designed to solve large coinputatioiial fluid dynamics problems. Due to the complexity of the architecture, devel-opment of effective high-level language compilers for the system appears to be a very difficult task. Consequently, a visual programming methodology has been developed wliicli allows users to program the system at an architectural level by constructing diagrams of the pipeline configuration. These schematic program representations can then be cliecked for validity and automatically translated into machine code. The visual environment is illustrated by using a prototype graphical editor to program an example problem. This work was supported by the National Aeronautics and Space Administration under NASA Contract No. NAS1-18107 while the authors were in residence at ICASE.

