Despite decades of research on high-level loop optimizations and their successful integration in production C/C++/FORTRAN compilers, most compiler internal loop transformation systems only partially address the challenges posed by the increased complexity and diversity of today’s hardware. Especially when exploiting domain specific knowledge to obtain optimal code for complex targets such as ac...

We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasiperiodic tiling. We prove that the tilings by a tileset that admits only quasiperiodic tilings have a recursively (and uniformly) bounded quasi-periodicity function. Thi...

A regular n-sided polygon can be split into n n-part spidrons. Alternate forms of linked triangular structures such as ladders and creepers can also be used to subdivide regular polygons. In the present paper new symmetric designs with inscribed regular polygons are constructed using n 6-part ladders. Also several new tiling patterns are created using these designs General Terms Tiling, Algorit...