Scientific Parallel Computing / / Babak Bagheri, Terry Clark, Larkin Ridgway Scott.
What does Google's management of billions of Web pages have in common with analysis of a genome with billions of nucleotides? Both apply methods that coordinate many processors to accomplish a single task. From mining genomes to the World Wide Web, from modeling financial markets to global weat...
Saved in:
| VerfasserIn: | |
|---|---|
| Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2021] 2005 |
| Year of Publication: | 2021 |
| Language: | English |
| Online Access: | |
| Physical Description: | 1 online resource (392 p.) :; 75 line illus. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 06858nam a22012615i 4500 | ||
|---|---|---|---|
| 001 | 9780691227658 | ||
| 003 | DE-B1597 | ||
| 005 | 20231209095929.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr || |||||||| | ||
| 008 | 231209t20212005nju fo d z eng d | ||
| 020 | |a 9780691227658 | ||
| 024 | 7 | |a 10.1515/9780691227658 |2 doi | |
| 035 | |a (DE-B1597)576675 | ||
| 040 | |a DE-B1597 |b eng |c DE-B1597 |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a nju |c US-NJ | ||
| 050 | 4 | |a QA76.58 | |
| 072 | 7 | |a COM048000 |2 bisacsh | |
| 082 | 0 | 4 | |a 004/.35 |2 22 |
| 100 | 1 | |a Scott, Larkin Ridgway, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Scientific Parallel Computing / |c Babak Bagheri, Terry Clark, Larkin Ridgway Scott. |
| 264 | 1 | |a Princeton, NJ : |b Princeton University Press, |c [2021] | |
| 264 | 4 | |c 2005 | |
| 300 | |a 1 online resource (392 p.) : |b 75 line illus. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 505 | 0 | 0 | |t Frontmatter -- |t Contents -- |t Preface -- |t Notation -- |t Chapter 1. Introduction -- |t Chapter 2. Parallel Performance -- |t Chapter 3. Computer Architecture -- |t Chapter 4. Dependences -- |t Chapter 5. Parallel Languages -- |t Chapter 6. Collective Operation -- |t Chapter 7. Current Programming Standards -- |t Chapter 8. The IPlanguage Model -- |t Chapter 9. High Performance Fortran -- |t Chapter 10. Loop Tiling -- |t Chapter 11. Matrix Eigen Analysis -- |t Chapter 12. Linear Systems -- |t Chapter 13. Particle Dynamics -- |t Chapter 14. Mesh Methods -- |t Chapter 15. Sorting -- |t Bibliography -- |t Index |
| 506 | 0 | |a restricted access |u http://purl.org/coar/access_right/c_16ec |f online access with authorization |2 star | |
| 520 | |a What does Google's management of billions of Web pages have in common with analysis of a genome with billions of nucleotides? Both apply methods that coordinate many processors to accomplish a single task. From mining genomes to the World Wide Web, from modeling financial markets to global weather patterns, parallel computing enables computations that would otherwise be impractical if not impossible with sequential approaches alone. Its fundamental role as an enabler of simulations and data analysis continues an advance in a wide range of application areas. Scientific Parallel Computing is the first textbook to integrate all the fundamentals of parallel computing in a single volume while also providing a basis for a deeper understanding of the subject. Designed for graduate and advanced undergraduate courses in the sciences and in engineering, computer science, and mathematics, it focuses on the three key areas of algorithms, architecture, languages, and their crucial synthesis in performance. The book's computational examples, whose math prerequisites are not beyond the level of advanced calculus, derive from a breadth of topics in scientific and engineering simulation and data analysis. The programming exercises presented early in the book are designed to bring students up to speed quickly, while the book later develops projects challenging enough to guide students toward research questions in the field. The new paradigm of cluster computing is fully addressed. A supporting web site provides access to all the codes and software mentioned in the book, and offers topical information on popular parallel computing systems. Integrates all the fundamentals of parallel computing essential for today's high-performance requirements Ideal for graduate and advanced undergraduate students in the sciences and in engineering, computer science, and mathematics Extensive programming and theoretical exercises enable students to write parallel codes quickly More challenging projects later in the book introduce research questions New paradigm of cluster computing fully addressed Supporting web site provides access to all the codes and software mentioned in the book | ||
| 538 | |a Mode of access: Internet via World Wide Web. | ||
| 546 | |a In English. | ||
| 588 | 0 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 09. Dez 2023) | |
| 650 | 0 | |a Parallel processing (Electronic computers). | |
| 650 | 7 | |a COMPUTERS / Systems Architecture / Distributed Systems & Computing. |2 bisacsh | |
| 653 | |a Allcache. | ||
| 653 | |a Amdahl, Gene. | ||
| 653 | |a Amdahl's Law. | ||
| 653 | |a Banerjee's inequality. | ||
| 653 | |a Brinch Hansen. | ||
| 653 | |a Cinderella. | ||
| 653 | |a Co-array Fortran. | ||
| 653 | |a Concurrent Pascal. | ||
| 653 | |a Gaussian elimination. | ||
| 653 | |a Jacobi iteration. | ||
| 653 | |a access set. | ||
| 653 | |a associative memory. | ||
| 653 | |a asymptotic upper bound. | ||
| 653 | |a bit operations. | ||
| 653 | |a bottleneck. | ||
| 653 | |a boundary value problem. | ||
| 653 | |a bus. | ||
| 653 | |a cache. | ||
| 653 | |a carrier index. | ||
| 653 | |a communication. | ||
| 653 | |a compact factorization. | ||
| 653 | |a control structure. | ||
| 653 | |a dance hall architecture. | ||
| 653 | |a data movement. | ||
| 653 | |a data parallelism. | ||
| 653 | |a dependence graph. | ||
| 653 | |a deterministic. | ||
| 653 | |a dimensional exchange. | ||
| 653 | |a discretization scheme. | ||
| 653 | |a distributed memory. | ||
| 653 | |a divide-and-conquer. | ||
| 653 | |a eigenpair. | ||
| 653 | |a eigenvalue. | ||
| 653 | |a eigenvector. | ||
| 653 | |a embarrassingly parallel. | ||
| 653 | |a full multigrid. | ||
| 653 | |a functional units. | ||
| 653 | |a global array toolkit. | ||
| 653 | |a guarded memory. | ||
| 653 | |a hypercube. | ||
| 653 | |a immersion. | ||
| 653 | |a implicit process group. | ||
| 653 | |a initial value problem. | ||
| 653 | |a iteration distribution. | ||
| 653 | |a iteration space. | ||
| 653 | |a iterative solvers. | ||
| 653 | |a legacy applications. | ||
| 653 | |a link popularity. | ||
| 653 | |a massive parallelism. | ||
| 653 | |a matrix product. | ||
| 653 | |a message passing. | ||
| 653 | |a network of workstations. | ||
| 700 | 1 | |a Bagheri, Babak, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 700 | 1 | |a Clark, Terry, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9780691227658?locatt=mode:legacy |
| 856 | 4 | 0 | |u https://www.degruyter.com/isbn/9780691227658 |
| 856 | 4 | 2 | |3 Cover |u https://www.degruyter.com/document/cover/isbn/9780691227658/original |
| 912 | |a EBA_BACKALL | ||
| 912 | |a EBA_CL_CHCOMSGSEN | ||
| 912 | |a EBA_EBACKALL | ||
| 912 | |a EBA_EBKALL | ||
| 912 | |a EBA_ECL_CHCOMSGSEN | ||
| 912 | |a EBA_EEBKALL | ||
| 912 | |a EBA_ESTMALL | ||
| 912 | |a EBA_PPALL | ||
| 912 | |a EBA_STMALL | ||
| 912 | |a GBV-deGruyter-alles | ||
| 912 | |a PDA12STME | ||
| 912 | |a PDA13ENGE | ||
| 912 | |a PDA18STMEE | ||
| 912 | |a PDA5EBK | ||