|
|
Sold Out
Book Categories |
| Preface | ||
| Introduction | ||
| Sect. I | Languages | |
| Ch. 1 | High Performance Fortran 2.0 | 3 |
| Ch. 2 | The Sisal Project: Real World Functional Programming | 45 |
| Ch. 3 | HPC++ and the HPC++Lib Toolkit | 73 |
| Ch. 4 | A Concurrency Abstraction Model for Avoiding Inheritance Anomaly in Object-Oriented Programs | 109 |
| Sect. II | Analysis | |
| Ch. 5 | Loop Parallelization Algorithms | 141 |
| Ch. 6 | Array Dataflow Analysis | 173 |
| Ch. 7 | Interprocedural Analysis Based on Guarded Array Regions | 221 |
| Ch. 8 | Automatic Array Privatization | 247 |
| Sect. III | Communication Optimizations | |
| Ch. 9 | Optimal Tiling for Minimizing Communication in Distributed Shared-Memory Multiprocessors | 285 |
| Ch. 10 | Communication-Free Partitioning of Nested Loops | 339 |
| Ch. 11 | Solving Alignment Using Elementary Linear Algebra | 385 |
| Ch. 12 | A Compilation Method for Communication-Efficient Partitioning of DOALL Loops | 413 |
| Ch. 13 | Compiler Optimization of Dynamic Data Distributions for Distributed-Memory Multicomputers | 445 |
| Ch. 14 | A Framework for Global Communication Analysis and Optimizations | 485 |
| Ch. 15 | Tolerating Communication Latency through Dynamic Thread Invocation in a Multithreaded Architecture | 525 |
| Sect. IV | Code Generation | |
| Ch. 16 | Advanced Code Generation for High Performance Fortran | 553 |
| Ch. 17 | Integer Lattice Based Methods for Local Address Generation for Block-Cyclic Distributions | 597 |
| Sect. V | Task Parallelism, Dynamic Data Structures and Run Time Systems | |
| Ch. 18 | A Duplication Based Compile Time Scheduling Method for Task Parallelism | 649 |
| Ch. 19 | SPMD Execution in the Presence of Dynamic Data Structures | 683 |
| Ch. 20 | Supporting Dynamic Data Structures with Olden | 709 |
| Ch. 21 | Runtime and Compiler Support for Irregular Computations | 751 |
| Author Index | 779 |
| Price | Condition | Delivery | Seller | Action |
| $129.00 | Digital |
| WonderClub |
Tyson Ratliff
reviewed Compiler Optimizations for Scalable Parallel Systems on July 07, 2010
Compiler Optimizations for Scalable Parallel Systems
I read this on the advice of Dr. Eiselt, Dean (at that time) of the College of Computing, after asking him via email "alright, I'm taking classes and whatnot, but I want the Stygian deep; I want to go down as far as I can; I want and need to read those books which have shaped the great computer scientists before me, the real thing." Having probed the shelves of computer science and mathematics since, I remain convinced he could have given no better advice to a precocious freshman. Used for several decades at MIT, this second edition is more than thorough enough for an introduction to computer science anywhere. Taught using the Scheme system (with its close bindings to the type-free λ-calculus), this canonical work covers register machines, logic programming, nondeterministic evaluation, the relations of recursion to iteration, and a wealth of carefully-woven-in jewels from number theory and discrete mathematics. Every programmer thinking himself the real deal owes it to himself to read through this grand work, epic in scope and breathtaking in sudden illuminations.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Compiler Optimizations for Scalable Parallel Systems
X
This Item is in Your Inventory
Compiler Optimizations for Scalable Parallel Systems
X
You must be logged in to review the productsX
X
X
Add Compiler Optimizations for Scalable Parallel Systems, Scalable parallel systems or, more generally, distributed memory systems offer a challenging model of computing and pose fascinating problems regarding compiler optimization, ranging from language design to run time systems. Research in this area is found, Compiler Optimizations for Scalable Parallel Systems to the inventory that you are selling on WonderClubX
X
Add Compiler Optimizations for Scalable Parallel Systems, Scalable parallel systems or, more generally, distributed memory systems offer a challenging model of computing and pose fascinating problems regarding compiler optimization, ranging from language design to run time systems. Research in this area is found, Compiler Optimizations for Scalable Parallel Systems to your collection on WonderClub |
