Accession Number : ADA227875
Title : Expressing User-Defined Parallelism in EPL (Equational Programming Language).
Descriptive Note : Technical rept.,
Corporate Author : RENSSELAER POLYTECHNIC INST TROY NY DEPT OF COMPUTER SCIENCE
Personal Author(s) : Ozturan, Can
Report Date : OCT 1990
Pagination or Media Count : 69
Abstract : EPL is a high level language which aims at producing efficient parallel code for a variety of architectures. EPL is an equational language and requires the computations to be expressed as systems of recurrent equations. This project describes two additions to EPL language which greatly simplifies the way user expresses parallelism. The first addition is that of a general purpose reduction operator called all. The second addition is the extension of the language to include annotations which the user can use to indicate parallelism at medium-grain level. The annotations are processed by the annotation preprocessor which has two functions. The first is determining a mapping of annotated processes onto a logical hierarchical tree structure which minimizes the total communication cost. We give an O(n2) heuristic algorithm to do this. The second function is to generate EPL code for each process. This part involves parallel scheduling of systems of recurrence equations and is beyond the scope of this project. We, however, discuss the issues that should be addressed in the code generator part which is left for future implementation. (kr)
Descriptors : *HIGH LEVEL LANGUAGES, *PARALLEL PROCESSING, ADDITION, CODERS, CODING, COMMUNICATION AND RADIO SYSTEMS, COMPUTATIONS, COSTS, EFFICIENCY, EQUATIONS, FUNCTIONS, HIERARCHIES, LANGUAGE, OPERATORS(PERSONNEL), PARALLEL ORIENTATION, PREPROCESSING, PROGRAMMING LANGUAGES, REDUCTION, SCHEDULING, TREES.
Subject Categories : Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE