Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Introduction to parallel programmingJanuary 1989
Publisher:
  • Academic Press Professional, Inc.
  • 525 B Street Suite 1900 San Diego, CA
  • United States
ISBN:978-0-12-128470-1
Published:03 January 1989
Pages:
422
Skip Bibliometrics Section
Reflects downloads up to 12 Nov 2024Bibliometrics
Abstract

No abstract available.

Cited By

  1. Huang F, Tie B, Tao J, Tan X and Ma Y (2020). Methodology and optimization for implementing cluster-based parallel geospatial algorithms with a case study, Cluster Computing, 23:2, (673-704), Online publication date: 1-Jun-2020.
  2. Huang F, Tao J, Xiang Y, Liu P, Dong L and Wang L (2017). Parallel compressive sampling matching pursuit algorithm for compressed sensing signal reconstruction with OpenCL, Journal of Systems Architecture: the EUROMICRO Journal, 72:C, (51-60), Online publication date: 1-Jan-2017.
  3. ACM
    Alonso G, Blott S, Fessler A and Schek H Correctness and parallelism in composite systems Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (197-208)
  4. Yan Y, Zhang X and Ma Q (1997). Software Support for Multiprocessor Latency Measurement and Evaluation, IEEE Transactions on Software Engineering, 23:1, (4-16), Online publication date: 1-Jan-1997.
  5. Shirai K and Hiwatashi J A design system for special purpose processors based on architectures for distributed processing Proceedings of the conference on European design automation, (380-385)
  6. ACM
    Hartman J and Sanders D (1991). Teaching a course in parallel processing with limited resources, ACM SIGCSE Bulletin, 23:1, (97-101), Online publication date: 1-Mar-1991.
  7. ACM
    Hartman J and Sanders D Teaching a course in parallel processing with limited resources Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, (97-101)
  8. Hanson F A real introduction to supercomputing Proceedings of the 1990 ACM/IEEE conference on Supercomputing, (376-385)
  9. ACM
    Sanders D and Hartman J Getting started with parallel programming Proceedings of the twenty-first SIGCSE technical symposium on Computer science education, (86-88)
  10. ACM
    Sanders D and Hartman J (1990). Getting started with parallel programming, ACM SIGCSE Bulletin, 22:1, (86-88), Online publication date: 1-Feb-1990.
Contributors

Reviews

Ryszard Janicki

This elementary and practical introduction to parallel programming is divided into 15 chapters: Introduction Tiny Fortran Hardware and Operating System Models Processes, Shared Memory, and Simple Parallel Programs Basic Parallel Programming Techniques Barriers and Race Conditions Introduction to Scheduling—Nested Loops Overcoming Data Dependencies Scheduling Summary Linear Recurrence Relations—Backward Dependencies Performance Tuning Discrete Event, Discrete Time Simulation Some Applications Semaphores and Events Programming Projects Most basic concepts, such as the creation of multiple processes, memory sharing, scheduling, and data dependencies, are covered and illustrated by examples in simplified FORTRAN. The book also presents a number of applications, such as a discrete-time, discrete-event simulator, numerical integration, Gaussian elimination, a parallel version of the traveling salesman problem, and the exploration of a maze. Unfortunately, the majority of the more advanced results and techniques (particularly the theoretical ones) are not mentioned. Still, Brawer has written a very good text for beginners (that is, programmers and researchers with no previous exposure to parallel programming).

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Recommendations