Automatic Generation of Interpolants for Lattice Samplings: Part II -- Implementation and Code Generation release_thw3sdmrwvh3fmtsxcgzbdyvmi

by Joshua Horacsek, Usman Alim

Published by arXiv.

2021  

Abstract

In the prequel to this paper, we presented a systematic framework for processing spline spaces. In this paper, we take the results of that framework and provide a code generation pipeline that automatically generates efficient implementations of spline spaces. We decompose the final algorithm from Part I and translate the resulting components into LLVM-IR (a low level language that can be compiled to various targets/architectures). Our design provides a handful of parameters for a practitioner to tune - this is one of the avenues that provides us with the flexibility to target many different computational architectures and tune performance on those architectures. We also provide an evaluation of the effect of the different parameters on performance.
In text/plain format

Archived Files and Locations

application/pdf  1.2 MB
file_2sokq3lyxvdshfmxdl6i7ooc5e
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   published
Date   2021-02-01
Version   1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 4c12e593-76d5-45d7-83e0-0d53eb9d345e
API URL: JSON