Parallel Processing from Applications to Systems.

By: Moldovan, Dan IMaterial type: TextTextSeries: eBooks on DemandPublisher: Burlington : Elsevier Science, 2014Description: 1 online resource (586 p.)ISBN: 9781483297514Subject(s): Parallel processing (Electronic computers)Genre/Form: Electronic books.Additional physical formats: Print version:: Parallel Processing from Applications to SystemsDDC classification: 004.35 | 004/.35 LOC classification: QA76.58 .M65 2014Online resources: Click here to view this ebook.
Contents:
Front Cover; Parallel Processing: From Applications to Systems; Copyright Page; Table of Contents; PREFACE; CHAPTER 1. INTRODUCTION; 1.1 PARALLELISM AS A CONCEPT; 1.2 APPLICATIONS OF PARALLEL PROCESSING; 1.3 RELATION BETWEEN PARALLEL ALGORITHMS AND ARCHITECTURES; 1.4 PERFORMANCE OF PARALLEL COMPUTATIONS; 1.5 MAIN ISSUES FOR FUTURE RESEARCH IN PARALLEL PROCESSING; 1.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 1.7 PROBLEMS; CHAPTER 2. ANALYSIS OF PARALLELISM IN COMPUTER ALGORITHMS; 2.1 DATA AND CONTROL DEPENDENCIES; 2.2 PARALLEL NUMERICAL ALGORITHMS; 2.3 PARALLEL NON-NUMERICAL ALGORITHMS
2.4 BIBLIOGRAPHICAL NOTES AND FURTHER READING2.5 PROBLEMS; CHAPTER 3. PROGRAM TRANSFORMATIONS; 3.1 REMOVAL OF OUTPUT DEPENDENCIES AND ANTIDEPENDENCIES; 3.2 PROGRAMS WITH LOOPS; 3.3 TRANSFORMATION OF INDEX SETS AND DEPENDENCIES; 3.4 OPTIMAL TIME TRANSFORMATIONS; 3.5 NONLINEAR TRANSFORMATIONS; 3.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 3.7 PROBLEMS; CHAPTER 4. ARRAY PROCESSORS; 4.1 SINGLE-INSTRUCTION MULTIPLE-DATA (SIMD) COMPUTERS; 4.2 INTERCONNECTION NETWORKS FOR SIMD COMPUTERS; 4.3 SIMD SUPERCOMPUTERS; 4.4 SYSTOLIC ARRAY PROCESSORS; 4.5 ASSOCIATIVE PROCESSING
4.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING4.7 PROBLEMS; CHAPTER 5. MAPPING ALGORITHMS INTO ARRAY PROCESSORS; 5.1 MAPPING OF ALGORITHMS INTO SYSTOLIC ARRAYS; 5.2 ALGORITHM PARTITIONING FOR FIXED-SIZE SYSTOLIC ARRAYS; 5.3 MAPPING OF ALGORITHMS INTO SIMD PROCESSORS; 5.4 MAPPING OF ALGORITHMS INTO MESH-CONNECTED NETWORKS; 5.5 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 5.6 PROBLEMS; CHAPTER 6. MULTIPROCESSOR SYSTEMS; 6.1 MULTIPROCESSOR ORGANIZATION AND OPERATING PRINCIPLES; 6.2 MULTIPROCESSOR INTERCONNECTION NETWORKS AND MEMORIES; 6.3 MAPPING ALGORITHMS INTO MULTIPROCESSORS
6.4 OPERATING SYSTEMS FOR MULTIPROCESSORS6.5 THE CEDAR MULTIPROCESSOR; 6.6 HYPERCUBE COMPUTERS; 6.7 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 6.8 PROBLEMS; CHAPTER 7. DATA-FLOW COMPUTING; 7.1 DATA-AND DEMAND-DRIVEN MODELS OF COMPUTATION; 7.2 STATIC DATA-FLOW COMPUTERS; 7.3 DYNAMIC DATA-FLOW COMPUTERS; 7.4 COMBINING DATA FLOW AND CONTROL FLOW; 7.5 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 7.6 PROBLEMS; CHAPTER 8. PARALLEL PROCESSING OF RULE-BASED SYSTEMS AND SEMANTIC NETWORKS; 8.1 PARALLELISM ANALYSIS IN RULE-BASED SYSTEMS; 8.2 MULTIPLE-RULE FIRING
8.3 KNOWLEDGE REPRESENTATION AND REASONING USING SEMANTIC NETWORKS8.4 PARALLEL NATURAL LANGUAGE PROCESSING; 8.5 SEMANTIC NETWORK ARRAY PROCESSOR; 8.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 8.7 PROBLEMS; BIBLIOGRAPHY; INDEX
Summary: This text provides one of the broadest presentations of parallelprocessing available, including the structure of parallelprocessors and parallel algorithms. The emphasis is on mappingalgorithms to highly parallel computers, with extensive coverage ofarray and multiprocessor architectures. Early chapters provideinsightful coverage on the analysis of parallel algorithms andprogram transformations, effectively integrating a variety ofmaterial previously scattered throughout the literature. Theory andpractice are well balanced across diverse topics in this concisepresentation. For exceptional cla
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number URL Status Date due Barcode
Electronic Book UT Tyler Online
Online
QA76.58 .M65 2014 (Browse shelf) http://uttyler.eblib.com/patron/FullRecord.aspx?p=1888745 Available EBL1888745

Front Cover; Parallel Processing: From Applications to Systems; Copyright Page; Table of Contents; PREFACE; CHAPTER 1. INTRODUCTION; 1.1 PARALLELISM AS A CONCEPT; 1.2 APPLICATIONS OF PARALLEL PROCESSING; 1.3 RELATION BETWEEN PARALLEL ALGORITHMS AND ARCHITECTURES; 1.4 PERFORMANCE OF PARALLEL COMPUTATIONS; 1.5 MAIN ISSUES FOR FUTURE RESEARCH IN PARALLEL PROCESSING; 1.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 1.7 PROBLEMS; CHAPTER 2. ANALYSIS OF PARALLELISM IN COMPUTER ALGORITHMS; 2.1 DATA AND CONTROL DEPENDENCIES; 2.2 PARALLEL NUMERICAL ALGORITHMS; 2.3 PARALLEL NON-NUMERICAL ALGORITHMS

2.4 BIBLIOGRAPHICAL NOTES AND FURTHER READING2.5 PROBLEMS; CHAPTER 3. PROGRAM TRANSFORMATIONS; 3.1 REMOVAL OF OUTPUT DEPENDENCIES AND ANTIDEPENDENCIES; 3.2 PROGRAMS WITH LOOPS; 3.3 TRANSFORMATION OF INDEX SETS AND DEPENDENCIES; 3.4 OPTIMAL TIME TRANSFORMATIONS; 3.5 NONLINEAR TRANSFORMATIONS; 3.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 3.7 PROBLEMS; CHAPTER 4. ARRAY PROCESSORS; 4.1 SINGLE-INSTRUCTION MULTIPLE-DATA (SIMD) COMPUTERS; 4.2 INTERCONNECTION NETWORKS FOR SIMD COMPUTERS; 4.3 SIMD SUPERCOMPUTERS; 4.4 SYSTOLIC ARRAY PROCESSORS; 4.5 ASSOCIATIVE PROCESSING

4.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING4.7 PROBLEMS; CHAPTER 5. MAPPING ALGORITHMS INTO ARRAY PROCESSORS; 5.1 MAPPING OF ALGORITHMS INTO SYSTOLIC ARRAYS; 5.2 ALGORITHM PARTITIONING FOR FIXED-SIZE SYSTOLIC ARRAYS; 5.3 MAPPING OF ALGORITHMS INTO SIMD PROCESSORS; 5.4 MAPPING OF ALGORITHMS INTO MESH-CONNECTED NETWORKS; 5.5 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 5.6 PROBLEMS; CHAPTER 6. MULTIPROCESSOR SYSTEMS; 6.1 MULTIPROCESSOR ORGANIZATION AND OPERATING PRINCIPLES; 6.2 MULTIPROCESSOR INTERCONNECTION NETWORKS AND MEMORIES; 6.3 MAPPING ALGORITHMS INTO MULTIPROCESSORS

6.4 OPERATING SYSTEMS FOR MULTIPROCESSORS6.5 THE CEDAR MULTIPROCESSOR; 6.6 HYPERCUBE COMPUTERS; 6.7 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 6.8 PROBLEMS; CHAPTER 7. DATA-FLOW COMPUTING; 7.1 DATA-AND DEMAND-DRIVEN MODELS OF COMPUTATION; 7.2 STATIC DATA-FLOW COMPUTERS; 7.3 DYNAMIC DATA-FLOW COMPUTERS; 7.4 COMBINING DATA FLOW AND CONTROL FLOW; 7.5 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 7.6 PROBLEMS; CHAPTER 8. PARALLEL PROCESSING OF RULE-BASED SYSTEMS AND SEMANTIC NETWORKS; 8.1 PARALLELISM ANALYSIS IN RULE-BASED SYSTEMS; 8.2 MULTIPLE-RULE FIRING

8.3 KNOWLEDGE REPRESENTATION AND REASONING USING SEMANTIC NETWORKS8.4 PARALLEL NATURAL LANGUAGE PROCESSING; 8.5 SEMANTIC NETWORK ARRAY PROCESSOR; 8.6 BIBLIOGRAPHICAL NOTES AND FURTHER READING; 8.7 PROBLEMS; BIBLIOGRAPHY; INDEX

This text provides one of the broadest presentations of parallelprocessing available, including the structure of parallelprocessors and parallel algorithms. The emphasis is on mappingalgorithms to highly parallel computers, with extensive coverage ofarray and multiprocessor architectures. Early chapters provideinsightful coverage on the analysis of parallel algorithms andprogram transformations, effectively integrating a variety ofmaterial previously scattered throughout the literature. Theory andpractice are well balanced across diverse topics in this concisepresentation. For exceptional cla

Description based upon print version of record.

There are no comments on this title.

to post a comment.