In order to get more accurate results, our search has the following Google-Type search functionality:
If you use '+' in front of a word, then that word will be present in the search results.
ex: Harry +Potter will return results with the word 'Potter'.
If you use '-' in front of a word, then that word will be absent in the search results.
ex: Harry -Potter will return results without the word 'Potter'.
If you use 'AND' between two words, then both of those words will be present in the search results.
ex: Harry AND Potter will return results with both 'Harry' and 'Potter'.
If you use 'OR' between two words, then bth of those words may or may not be present in the search results.
ex: Harry OR Potter will return results with just 'Harry', results with just 'Potter' and results with both 'Harry' and 'Potter'.
If you use 'NOT' before a word, then that word will be absent in the search results.
ex: Harry NOT Potter will return results without the word 'Potter'.
Placing '""' around words will perform a phrase search. The search results will contain those words in that order.
ex: "Harry Potter" will return any results with 'Harry Potter' in them, but not 'Potter Harry'.
Using '*' in a word will perform a wildcard search. The '*' signifies any number of characters. Searches can not start with a wildcard.
ex: Pot*er will return results with words starting with 'Pot' and ending in 'er'. In this case, 'Potter' will be a match.
Loop tiling, as one of the most important compiler optimizations, is beneficial for both parallel machines and uniprocessors with a memory hierarchy. This book explores the use of loop tiling for reducing communication cost and improving parallelism for distributed memory machines. The author provides mathematical foundations, investigates loop permutability in the framework of nonsingular loop transformations, discusses the necessary machineries required, and presents state-of-the-art results for finding communication- and time-minimal tiling choices. Throughout the book, theorems and algorithms are illustrated with numerous examples and diagrams. The techniques presented in Loop Tiling for Parallelism can be adapted to work for a cluster of workstations, and are also directly applicable to shared-memory machines once the machines are modeled as BSP (Bulk Synchronous Parallel) machines. Features and key topics: Detailed review of the mathematical foundations, including convex polyhedra and cones; Self-contained treatment of nonsingular loop transformations, code generation, and full loop permutability; Tiling loop nests by rectangles and parallelepipeds, including their mathematical definition, dependence analysis, legality test, and code generation; A complete suite of techniques for generating SPMD code for a tiled loop nest; Up-to-date results on tile size and shape selection for reducing communication and improving parallelism; End-of-chapter references for further reading. Researchers and practitioners involved in optimizing compilers and students in advanced computer architecture studies will find this a lucid and well-presented reference work with numerous citations to original sources.
Full Product DetailsAuthor: Jingling Xue
Publisher: Kluwer Academic Publishers
Imprint: Kluwer Academic Publishers
Country of Publication: United States
Volume: v. 575
Dimensions: Width: 15.60cm , Height: 1.70cm , Length: 23.40cm
ISBN 10: 0792379330
Publication Date: August 2000
Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly
Publisher's Status: Active
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you.
Table of Contents
Tab Content 6Author Website:
Recent ReviewsNo review item found!
Add your own review!
Countries AvailableAll regions