Seiler, LarryLin, DaqiYuksel, CemYuksel, Cem and Membarth, Richard and Zordan, Victor2020-10-302020-10-3020202577-6193https://doi.org/10.1145/3406177https://diglib.eg.org:443/handle/10.1145/3406177We propose a method to reduce the footprint of compressed data by using modified virtual address translation to permit random access to the data. This extends our prior work on using page translation to perform automatic decompression and deswizzling upon accesses to fixed rate lossy or lossless compressed data. Our compaction method allows a virtual address space the size of the uncompressed data to be used to efficiently access variable-size blocks of compressed data. Compression and decompression take place between the first and second level caches, which allows fast access to uncompressed data in the first level cache and provides data compaction at all other levels of the memory hierarchy. This improves performance and reduces power relative to compressed but uncompacted data. An important property of our method is that compression, decompression, and reallocation are automatically managed by the new hardware without operating system intervention and without storing compression data in the page tables. As a result, although some changes are required in the page manager, it does not need to know the specific compression algorithm and can use a single memory allocation unit size. We tested our method with two sample CPU algorithms. When performing depth buffer occlusion tests, our method reduces the memory footprint by 3.1x. When rendering into textures, our method reduces the footprint by 1.69x before rendering and 1.63x after. In both cases, the power and cycle time are better than for uncompacted compressed data, and significantly better than for accessing uncompressed data.Computing methodologiesImage compressionGraphics processorsComputer systems organizationProcessors and memory architectures.Shared virtual memorylossless compressionaddress swizzlingpage tablestiled resourcessparse textures10.1145/3406177