Abstract
Tilling starts with an iteration space and partitions the iteration space into uniform tiles of a given size and shape. The tiles can be any shapes such as triangles, squares, rectangles, parallelograms, hexagons or their higher-dimensional equivalents. In practice, however, squares, rectangles and parallelograms are common. As a result, two types of tiling techniques are distinguished in the literature: rectangular tiling and parallelepiped tiling. In the former case, all tiles are squares, rectangles or their higher-dimensional equivalents. In the latter case, the tiles can also be parallelepipeds (known as parallelograms in the 2-D space).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Xue, J. (2000). Rectangular Tiling. In: Loop Tiling for Parallelism. The Springer International Series in Engineering and Computer Science, vol 575. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4337-4_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4337-4_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6948-6
Online ISBN: 978-1-4615-4337-4
eBook Packages: Springer Book Archive