Data-parallel programming on MIMD computers / Philip J. Hatcher and Michael J. Quinn.
1991
QA76.5 .H42 1991eb
Formats
| Format | |
|---|---|
| BibTeX | |
| MARCXML | |
| TextMARC | |
| MARC | |
| DublinCore | |
| EndNote | |
| NLM | |
| RefWorks | |
| RIS |
Linked e-resources
Linked Resource
Details
Title
Data-parallel programming on MIMD computers / Philip J. Hatcher and Michael J. Quinn.
Author
ISBN
9780262288484 (electronic bk.)
0262288486 (electronic bk.)
0262082055
9780262082051
0262288486 (electronic bk.)
0262082055
9780262082051
Publication Details
Cambridge, Mass. : MIT Press, ©1991.
Language
English
Description
1 online resource (xiv, 231 pages) : illustrations.
Call Number
QA76.5 .H42 1991eb
Dewey Decimal Classification
005.2
Summary
Data-Parallel Programming demonstrates that architecture-independent parallel programming is possible by describing in detail how programs written in a high-level SIMD programming language may be compiled and efficiently executed-on both shared-memory multiprocessors and distributed-memory multicomputers.MIMD computers are notoriously difficult to program. Data-Parallel Programming demonstrates that architecture-independent parallel programming is possible by describing in detail how programs written in a high-level SIMD programming language may be compiled and efficiently executed-on both shared-memory multiprocessors and distributed-memory multicomputers. The authors provide enough data so that the reader can decide the feasibility of architecture-independent programming in a data-parallel language. For each benchmark program they give the source code listing, absolute execution time on both a multiprocessor and a multicomputer, and a speedup relative to a sequential program. And they often present multiple solutions to the same problem, to better illustrate the strengths and weaknesses of these compilers. The language presented is Dataparallel C, a variant of the original C* language developed by Thinking Machines Corporation for its Connection Machine processor array. Separate chapters describe the compilation of Dataparallel C programs for execution on the Sequent multiprocessor and the Intel and nCUBE hypercubes, respectively. The authors document the performance of these compilers on a variety of benchmark programs and present several case studies.ContentsIntroduction Dataparallel C Programming Language Description Design of a Multicomputer Dataparallel C Compiler Design of a Multiprocessor Dataparallel C Compiler Writing Efficient Programs Benchmarking the Compilers Case Studies Conclusions
Access Note
Access limited to authorized users.
Source of Description
OCLC-licensed vendor bibliographic record.
Added Author
Record Appears in