Data-parallel programming on MIMD computers / (Record no. 73125)

000 -LEADER
fixed length control field 03716nam a2200529 i 4500
001 - CONTROL NUMBER
control field 6267471
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220712204715.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151228s1991 mau ob 001 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9780262288484
-- electronic
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
082 0# - CLASSIFICATION NUMBER
Call Number 005.2
100 1# - AUTHOR NAME
Author Hatcher, Philip J.,
245 10 - TITLE STATEMENT
Title Data-parallel programming on MIMD computers /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 PDF (250 pages).
490 1# - SERIES STATEMENT
Series statement Scientific and engineering computation
520 ## - SUMMARY, ETC.
Summary, etc 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.Philip J. Hatcher is Assistant Professor in the Department of Computer Science at the University of New Hampshire. Michael J. Quinn is Associate Professor of Computer Science at Oregon State University.Contents: Introduction. 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.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Programming.
700 1# - AUTHOR 2
Author 2 Quinn, Michael J.
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267471
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cambridge, Massachusetts :
-- MIT Press,
-- 1991.
264 #2 -
-- [Piscataqay, New Jersey] :
-- IEEE Xplore,
-- [1991]
336 ## -
-- text
-- rdacontent
337 ## -
-- electronic
-- isbdmedia
338 ## -
-- online resource
-- rdacarrier
588 ## -
-- Description based on PDF viewed 12/28/2015.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Parallel programming (Computer science)
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- MIMD computers
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- C (Computer program language)

No items available.