DocumentCode
2023121
Title
An introduction to the portable parallel programming language Seymour
Author
Miller, Russ ; Stout, Quentin F.
Author_Institution
Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
fYear
1989
fDate
20-22 Sep 1989
Firstpage
94
Lastpage
101
Abstract
Seymour, a high-level data parallel programming language that can be used to design, express, and implement efficient portable parallel algorithms, is introduced. Seymour is based on the approach of designing parallel algorithms based on standardized global operations such as prefix, broadcast, sort, compression, and associative read. Seymour also incorporates fundamental paradigms, such as divide-and-conquer, reduce-and-create-cross-product, and reduce-and-compress, which are derived from theoretical parallel algorithms. Seymour redirects the difficulties of portability and efficiency into similar difficulties for the global operations and paradigms. However, the cost of developing efficient implementations of standardized operations on the various target architectures can be amortized over numerous algorithms
Keywords
high level languages; parallel algorithms; parallel programming; associative read; broadcast; compression; divide-and-conquer; global operations; high-level data; parallel algorithms; portable parallel programming language Seymour; prefix; reduce-and-compress; reduce-and-create-cross-product; sort; standardized global operations; Algorithm design and analysis; Computer architecture; Computer science; Concurrent computing; LAN interconnection; Parallel algorithms; Parallel machines; Parallel processing; Parallel programming; Programming profession;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1989. COMPSAC 89., Proceedings of the 13th Annual International
Conference_Location
Orlando, FL
Print_ISBN
0-8186-1964-3
Type
conf
DOI
10.1109/CMPSAC.1989.65063
Filename
65063
Link To Document