Chapter

Space-Filling Curves

Volume 9 of the series Texts in Computational Science and Engineering pp 195-214

Date:

Case Study: Cache Efficient Algorithms for Matrix Operations

  • Michael BaderAffiliated withDepartment of Informatics, Technische Universität München

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In Chaps. 10 and 11, we discussed applications of space-filling curves for parallelisation, which were motivated by their locality properties. In the following two chapters, we will discuss further applications, which again exploit the intrinsic locality properties of space-filling curves. As both applications will focus on inherently cache-efficient algorithms, we will start with a short introduction to cache-memory architectures, and discuss the resulting requirements on cache-efficient algorithms.