DocumentCode
3109274
Title
The use of aFP to design regular array algorithms
Author
Lin, Yen-Chun ; Lin, Ferng-Ching
Author_Institution
Nat. Taiwan Univ., Taipei, Taiwan
fYear
1988
fDate
9-13 Oct 1988
Firstpage
388
Lastpage
395
Abstract
The authors introduce a language called aFP (array FP), which is a dialect of FP containing many desirable parallel constructs. It extends FP with additional primitive functions and higher-order functions for the purpose of designing regular arrays. In aFP, the authors describe algorithms in a parallel way to a large degree. The authors give the mappings of aFP functions together with input patterns to regular array structures. The mapped basic array algorithms can then be used as building blocks to construct more complex ones. In addition, aFP can be adapted to be a programming language in programmable systolic systems
Keywords
data structures; functional programming; parallel algorithms; specification languages; aFP; array FP; data structures; functional programming; higher-order functions; parallel algorithms; parallel constructs; primitive functions; programmable systolic systems; regular array algorithms; specification languages; Algorithm design and analysis; Circuit synthesis; Combinational circuits; Computer languages; Data mining; Functional programming; Hardware; Page description languages; Systolic arrays; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Languages, 1988. Proceedings., International Conference on
Conference_Location
Miami Beach, FL
Print_ISBN
0-8186-0874-9
Type
conf
DOI
10.1109/ICCL.1988.13088
Filename
13088
Link To Document