Open Access
Programming distributed memory architectures using Kali
Piyush Mehrotra,John Vanrosendale +1 more
- 01 Oct 1990
TL;DR: The paper presents a new programming environment, Kali, which provides a global name space and allows direct access to remote data values and a system of annotations, allowing the user to control those aspects of the program critical to performance, such as data distribution and load balancing.
read more
Abstract: Programming nonshared memory systems is more difficult than programming shared memory systems, in part because of the relatively low level of current programming environments for such machines. A new programming environment is presented, Kali, which provides a global name space and allows direct access to remote data values. In order to retain efficiency, Kali provides a system on annotations, allowing the user to control those aspects of the program critical to performance, such as data distribution and load balancing. The primitives and constructs provided by the language is described, and some of the issues raised in translating a Kali program for execution on distributed memory systems are also discussed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Programming in Vienna Fortran
TL;DR: This paper presents the language features of Vienna Fortran for FORTRAN 77, together with examples illustrating the use of these features and discusses the advantages of a shared memory programming paradigm while explicitly controlling the data distribution.
Enhanced accuracy by post-processing for finite element methods for hyperbolic equations
TL;DR: This work considers the enhancement of accuracy, by means of a simple post-processing technique, for finite element approximations to transient hyperbolic equations, and shows results displaying the sharpness of the estimates.
Compiling for distributed-memory systems
Hans P. Zima,Barbara Chapman +1 more
- 01 Feb 1993
TL;DR: Compilation techniques for the source-to-source translation of programs in an extended FORTRAN 77 to equivalent parallel message-passing programs are discussed and additional optimization methods and advanced parallelization techniques, including run-time analysis are addressed.
135
Computer support for machine-independent parallel programming in Fortran D
Seema Hiranandani,Ken Kennedy,Chau-Wen Tseng +2 more
- 03 Jan 1992
TL;DR: The design of a prototype Fortran D compiler for the iPSC/860, a MIMD distributed-memory machine is presented and issues addressed include data decomposition analysis, guard introduction, communications generation and optimization, program transformations, and storage assignment.
115
•Book
High performance Fortran
David B. Loveman
- 01 Mar 1995
TL;DR: SimD and MIMD systems, previous attempts to develop languages for them, the genesis of the HPFF, how the group actually worked, and the HPF programming model are described.
103
References
•Book
Solving Problems on Concurrent Processors
Geoffrey C. Fox
- 01 Mar 1988
TL;DR: Self steering systems for marine craft are described which comprise wind direction sensing and course setting means, servo rudder means operatively connected to a rudder and connecting means linking the servo rubber means to the wind sensing andcourse setting means.
1.3K
Linda and Friends
TL;DR: Linda consists of a few simple operators designed to support and simplify the construction of explicitly-parallel programs, which is to make it largely unnecessary to think about the coupling between parallel processes.
599
SUPERB: A tool for semi-automatic MIMD/SIMD parallelization☆
Hans P. Zima,Heinz-J Bast,Michael Gerndt +2 more
- 01 Jan 1988
TL;DR: The design of an interactive system for the semi-automatic transformation of FORTRAN 77 programs into parallel programs for the SUPERNUM machine is described, characterized by a powerful analysis component, a catalog of MIMD and SIMD parallelization transformations, and a flexible dialog facility.
384
Data optimization: allocation of arrays to reduce communication on SIMD machines
TL;DR: This work discusses techniques for automatic layout of arrays in a compiler targeted to SIMD architectures, such as the Connection Machine computer system, and attempts to minimize the cost of moving data among processors.
233
Run-time scheduling and execution of loops on message passing machines
Joel H. Saltz,Kathleen Crowley,Kathleen Crowley,Ravi Mirchandaney,Ravi Mirchandaney,Harry Berryman +5 more
TL;DR: This work examines the effectiveness of optimizations aimed to allowing distributed machine to efficiently compute inner loops over globally defined data structures by targeting loops in which some array references are made through a level of indirection.
200
Related Papers (5)
Hans P. Zima,Heinz-J Bast,Michael Gerndt +2 more
- 01 Jan 1988
Françoise André,Jean-Louis Pazat,Henry Thomas +2 more
- 01 Jun 1990
Hans P. Zima,Barbara Chapman +1 more
- 01 Feb 1993