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.
| Original language | English |
|---|---|
| Pages (from-to) | 94-101 |
| Number of pages | 8 |
| Journal | Proceedings - IEEE Computer Society's International Computer Software and Applications Conference |
| State | Published - 1989 |
| Event | Proceedings of the Thirteenth Annual International Computer Software & Applications Conference - COMPSAC 89 - Orlando, FL, USA Duration: Sep 20 1989 → Sep 22 1989 |
Fingerprint
Dive into the research topics of 'Introduction to the portable parallel programming language Seymour'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver