Skip to main content
Book cover

Loop Tiling for Parallelism

  • Book
  • © 2000

Overview

Part of the book series: The Springer International Series in Engineering and Computer Science (SECS, volume 575)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Mathematic Background and Loop Transformation

  2. Tiling as a Loop Transformation

  3. Tiling for Distributed-Memory Machines

Keywords

About this book

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.

Authors and Affiliations

  • School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia

    Jingling Xue

Bibliographic Information

  • Book Title: Loop Tiling for Parallelism

  • Authors: Jingling Xue

  • Series Title: The Springer International Series in Engineering and Computer Science

  • DOI: https://doi.org/10.1007/978-1-4615-4337-4

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 2000

  • Hardcover ISBN: 978-0-7923-7933-1Published: 31 August 2000

  • Softcover ISBN: 978-1-4613-6948-6Published: 12 October 2012

  • eBook ISBN: 978-1-4615-4337-4Published: 06 December 2012

  • Series ISSN: 0893-3405

  • Edition Number: 1

  • Number of Pages: XIX, 256

  • Topics: Processor Architectures

Publish with us