Skip to main navigation Skip to search Skip to main content

WRITING SIMD ALGORITHMS.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

Tightly coupled multiprocessor systems, many of which are SIMD, are currently being considered as a cost-effective means to efficiently solve computationally time-intensive problems. The author discusses features of a SIMD language that are necessary in order to make these architectural advancements more accessible to the general problem-solving community. Two of the criteria on which the suitability of a programming language is based are its ability to allow for human communication and its ability to act as a vehicle for instructing a computer. The author examines the possibility of meeting the first criterion by expressing parallel algorithms in a pseudo Parallel Pascal. In an effort to better meet the second criterion, he discusses the possibility of augmenting current high-level parallel languages with a few fundamental operations that will make them language more inviting not only to SIMD programmers, but to problem solvers in general.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages122-125
Number of pages4
ISBN (Print)0818606428
StatePublished - 1985

Fingerprint

Dive into the research topics of 'WRITING SIMD ALGORITHMS.'. Together they form a unique fingerprint.

Cite this