OPEN EDUCATIONAL RESOURCES

UPA PERPUSTAKAAN UNEJ | NPP. 3509212D1000001

  • Home
  • Admin
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Data-parallel programming on MIMD computers
Bookmark Share

Text

Data-parallel programming on MIMD computers

Hatcher, Philip J. - Personal Name; Quinn, Michael J. - Personal Name;

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 ConclusionsOCLC-licensed vendor bibliographic record.


Availability

No copy data

Detail Information
Series Title
-
Call Number
-
Publisher
Cambridge, Mass. : : MIT Press,., 1991
Collation
1 online resource (xiv, 231 pages) :illustrations.
Language
English
ISBN/ISSN
9780262288484
Classification
NONE
Content Type
text
Media Type
computer
Carrier Type
online resource
Edition
-
Subject(s)
Parallel programming (Computer science)
MIMD computers
C (Computer program language)
Specific Detail Info
-
Statement of Responsibility
Philip J. Hatcher and Michael J. Quinn.
Other Information
Cataloger
imron
Source
-
Validator
-
Digital Object Identifier (DOI)
https://doi.org/10.7551/mitpress/2278.001.0001
Journal Volume
-
Journal Issue
-
Subtitle
-
Parallel Title
-
Other version/related

No other version available

File Attachment
  • Data-parallel programming on MIMD computers
Comments

You must be logged in to post a comment

OPEN EDUCATIONAL RESOURCES

Search

start it by typing one or more keywords for title, author or subject


Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?