Parallel Processing and Parallel Algorithms: Theory and Computation
β Scribed by Seyed H. Roosta (auth.)
- Publisher
- Springer-Verlag New York
- Year
- 2000
- Tongue
- English
- Leaves
- 578
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
Motivation It is now possible to build powerful single-processor and multiprocessor systems and use them efficiently for data processing, which has seen an explosive exΒ pansion in many areas of computer science and engineering. One approach to meeting the performance requirements of the applications has been to utilize the most powerful single-processor system that is available. When such a system does not provide the performance requirements, pipelined and parallel processΒ ing structures can be employed. The concept of parallel processing is a deparΒ ture from sequential processing. In sequential computation one processor is inΒ volved and performs one operation at a time. On the other hand, in parallel computation several processors cooperate to solve a problem, which reduces computing time because several operations can be carried out simultaneously. Using several processors that work together on a given computation illustrates a new paradigm in computer problem solving which is completely different from sequential processing. From the practical point of view, this provides sufficient justification to investigate the concept of parallel processing and related issues, such as parallel algorithms. Parallel processing involves utilizing several factors, such as parallel architectures, parallel algorithms, parallel programming lanΒ guages and performance analysis, which are strongly interrelated. In general, four steps are involved in performing a computational problem in parallel. The first step is to understand the nature of computations in the specific application domain.
β¦ Table of Contents
Front Matter....Pages i-xix
Computer Architecture....Pages 1-56
Components of Parallel Computers....Pages 57-108
Principles of Parallel Programming....Pages 109-136
Parallel Programming Approaches....Pages 137-216
Principles of Parallel Algorithm Design....Pages 217-258
Parallel Graph Algorithms....Pages 259-318
Parallel Search Algorithms....Pages 319-353
Parallel Computational Algorithms....Pages 355-410
Data Flow and Functional Programming....Pages 411-437
Asynchronous Parallel Programming....Pages 439-476
Data Parallel Programming....Pages 477-499
Artificial Intelligence and Parallel Processing....Pages 501-534
Back Matter....Pages 535-566
β¦ Subjects
Algorithm Analysis and Problem Complexity; Programming Techniques
π SIMILAR VOLUMES
Motivation It is now possible to build powerful single-processor and multiprocessor systems and use them efficiently for data processing, which has seen an explosive ex- pansion in many areas of computer science and engineering. One approach to meeting the performance requirements of the application
"There is a software gap between the hardware potential and the performance that can be attained using today's software parallel program development tools. The tools need manual intervention by the programmer to parallelize the code. Programming a parallel computer requires closely studying the t
There is a software gap between the hardware potential and the performance that can be attained using today's software parallel program development tools. The tools need manual intervention by the programmer to parallelize the code. Programming a parallel computer requires closely studying the targe
There is a software gap between the hardware potential and the performance that can be attained using today's software parallel program development tools. The tools need manual intervention by the programmer to parallelize the code. Programming a parallel computer requires closely studying the targe