DocumentCode
1141354
Title
Parallelism and Representation Problems in Distributed Systems
Author
Flynn, Michael J. ; Hennessy, John L.
Author_Institution
Computer Systems Laboratory, Stanford University
Issue
12
fYear
1980
Firstpage
1080
Lastpage
1086
Abstract
A hierarchical view of program representation is used to explain the problems of matching various representations to underlying distributed architectures. If a program is to effectively use a distributed computer system, it is necessary to represent and detect a high degree of parallelism. Methods of detecting such parallelism and their limitations are discussed. The actual machine level representation of a high-level language program also affects the ability to achieve a good match between the computer system resources and the program. The concept of an ideal machine for the program leads naturally to a representation employing a directly executed language. The initial program representation profoundly influences the possibility of obtaining a good representation at other levels of the hierarchy. A poor initial language representation leads to unnecessary architectural contraints or insufficient information to efficiently execute a program. The issue of suitable initial representation for distributed hardware is approached employing a functional language basis.
Keywords
Directly executed languages; distributed systems; functional programming; parallelism; representation; Computational modeling; Computer architecture; Concurrent computing; Degradation; Distributed computing; Functional programming; Hardware; High level languages; Missiles; Parallel processing; Directly executed languages; distributed systems; functional programming; parallelism; representation;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1980.1675513
Filename
1675513
Link To Document