No label defined (Q3750117)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3986635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3986635 |
Statements
1986
0 references
survey
0 references
L-Project
0 references
universal high-level parallel programming language
0 references
L- language
0 references
parallel computer
0 references
symbolic computation
0 references
transputer
0 references
processor interconnection topology
0 references
[For the entire collection see Zbl 0591.00036.] This is a survey on the L-Project, a research project (1978-) at the Research Institute of Symbolic Computation, University of Linz, Austria. The purpose of the project is the design and implementation of a universal high-level parallel programming language, the L-language and a parallel computer on which the L-language can be realized. Although the domain of applications is universal, the emphasis of the design is on applications in symbolic computation (computer algebra, automated theorem proving, computational geometry etc.) In these applications, typically, the interconnection topology between parallel subprocesses is of very diverse nature including topologies that change during execution. This is in contrast to more conventional parallel machine concepts in which vector or array topologies prevail. In the first stage of the L-project (1978-1980), the concept of an L-Module had been developed, which roughly had the same functional characteristic as the recent transputer. In the second stage (1980-1985), the L-Language and a compiler translating L- Language programs into the machine code of the L-Machine was developed. The L-machine is a parallel machine with extremely flexible processor interconnection topology. Programs in the L-Language have the characteristic feature that they contain a (recursive or iterative) description of the logical interconnection topology between processes. The compiler of the L-Language translates these description into concrete physical interconnections in the L-machine. The ability of the L-Language to describe all types of interconnection topologies is a language feature that has not been proposed and implemented before. The third stage of the project aims at the realization of the L-Language on transputer networks.
0 references