Abstract
The emergence of commercially produced parallel computers has greatly increased the problem of producing transportable mathematical software. Exploiting these new parallel capabilities has led to extensions of existing languages such as FORTRAN and to proposals for the development of entirely new parallel languages. We present an attempt at a short term solution to the transportability problem. The motivation for developing the package has been to extend capabilities beyond loop based parallelism and to provide a convenient machine independent user interface. A package called SCHEDULE is described which provides a standard user interface to several shared memory parallel machines. A user writes standard FORTRAN code and calls SCHEDULE routines which express and enforce the large grain data dependencies of his parallel algorithm. Machine dependencies are internal to SCHEDULE and change from one machine to another but the users code remains essentially the same across all such machines. The semantics and usage of SCHEDULE are described and several examples of parallel algorithms which have been implemented using SCHEDULE are presented.
Original language | English |
---|---|
Pages (from-to) | 175-186 |
Number of pages | 12 |
Journal | Parallel Computing |
Volume | 5 |
Issue number | 1-2 |
DOIs | |
State | Published - Jul 1987 |
Externally published | Yes |
Funding
* Work supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contracts W-31-109-Eng-38, DE-AC05-840R21400, and DE-FGO2-85ER25001.
Funders | Funder number |
---|---|
Office of Energy Research | |
U.S. Department of Energy | W-31-109-Eng-38, DE-FGO2-85ER25001, DE-AC05-840R21400 |
Keywords
- Parallel programming
- multiprocessor systems
- portable implementation of parallel algorithms
- the package SCHEDULE