An empirical study of the effect of source-level loop transformations on compiler stability
Modern compiler optimization is a complex process that offers no guarantees to deliver the
fastest, most efficient target code. For this reason, compilers struggle to produce a stable …
fastest, most efficient target code. For this reason, compilers struggle to produce a stable …
Fast compiling source code without dependencies
AR Hoffman - US Patent 11,200,038, 2021 - Google Patents
Techniques for an ultra-fact software compilation of source code are provided. A compiler
receives software code and may divide it into code sections. A map of ordered nodes may …
receives software code and may divide it into code sections. A map of ordered nodes may …
Polyhedral Compilation Support for C++ Features: A Case Study with CPPTRAJ
This paper reveals challenges in migrating C++ codes to GPUs using polyhedral compiler
technology. We point to instances where reasoning about C++ constructs in a polyhedral …
technology. We point to instances where reasoning about C++ constructs in a polyhedral …
Exploiting and coping with sparsity to accelerate DNNs on CPUs
Z Gong - 2021 - ideals.illinois.edu
Abstract Deep Neural Networks (DNNs) have become ubiquitous, achieving state-of-the-art
results across a wide range of tasks. While GPUs and domain specific accelerators are …
results across a wide range of tasks. While GPUs and domain specific accelerators are …
Ultra-fast install and update of an operating system
AR Hoffman - US Patent 11,314,496, 2022 - Google Patents
Techniques for an ultra-fast installation of a new operating system are provided.
Conventional dependencies are ignored in a way that allows multiple components to be …
Conventional dependencies are ignored in a way that allows multiple components to be …
[PDF][PDF] Unitary Decomposition
AM Krol - repository.tudelft.nl
In this thesis, I explain my implementation of Unitary Decomposition in OpenQL. Unitary
Decomposition is an algorithm for translating a unitary matrix into many small unitary …
Decomposition is an algorithm for translating a unitary matrix into many small unitary …
Fast compiling source code without dependencies
AR Hoffman - US Patent 12,106,080, 2024 - Google Patents
Techniques for an ultra-fact software compilation of source code are provided. A compiler
receives software code and may divide it into code sections. A map of ordered nodes may …
receives software code and may divide it into code sections. A map of ordered nodes may …
Ultra-fast install of computer system software
AR Hoffman - US Patent 11,748,084, 2023 - Google Patents
Techniques for an ultra-fast installation of a new operating system are provided.
Conventional dependencies are ignored in a way that allows multiple components to be …
Conventional dependencies are ignored in a way that allows multiple components to be …
Fast compiling source code without dependencies
AR Hoffman - US Patent 11,669,313, 2023 - Google Patents
the disclosure generally relates to fundamental changes in software operations and allowing
faster actions by changing the way software dependencies operate, particularly in some …
faster actions by changing the way software dependencies operate, particularly in some …