Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 248 for “"compilers"”.
-
Symbolic analysis for parallelizing compilers
The notion of dependence captures the most important properties of a program for efficient execution on parallel computers. The dependence structure of a program defines the necessary constraints of the order of execution of the program components, and provides sufficient information for the …
-
Modular Compilers and Their Correctness Proofs
… the construction and correctness of modular compilers. Modular compilation is a compiler construction technique allowing the construction of compilers for high-level programming languages from reusable compiler building blocks. Modular compilers are defined in terms of denotational semantics …
-
Syntax-Directed Error Recovery for Compilers
Made available in DSpace on 2014-12-10T20:13:29Z (GMT). No. of bitstreams: 1 7206983.pdf: 5968265 bytes, checksum: 167b685834782c50adcab40596de9e1d (MD5) Previous issue date: 1971
-
Editing Compilers, Their Feasibility and Effects
Made available in DSpace on 2014-12-08T22:24:03Z (GMT). No. of bitstreams: 1 6706625.pdf: 3423355 bytes, checksum: 98f09f461666f666ace4fcad10841817 (MD5) Previous issue date: 1966
-
Constructing Efficient Extensible Compilers With Incremental Analysis
Much of the research in compiler design and optimization has traditionally focused on the effectiveness and efficiency of code optimization. However, the subject of efficiency of the entire compilation process itself (as opposed to the complexity of individual analysis or optimization algorithms) …
-
Unfield sparse formats for tensor algebra compilers
Tensor algebra is a powerful tool for computing on multidimensional data and has applications in many fields. Practical applications often deal with tensors that are sparse, and there exists a wide variety of formats for storing such tensors, each suited to specific types of applications and data. …
-
How should compilers represent fork-join parallelism?
… intermediate representation (IR). Mainstream compilers typically treat parallel linguistic constructs as syntactic sugar for function calls into a parallel runtime. These calls prevent the compiler from performing optimizations across parallel control constructs. Remedying this situation is …
-
Languages and Compilers for Rendering and Image Processing
… of machine learning to these languages and their compilers. Rendering systems suffer from a tension between separation of concerns and performance. Existing rendering systems typically focus on performance, but complex probability computations make advanced rendering algorithms difficult to …
-
Programming models, compilers, and runtime systems for accelerator computing
Accelerators, such as GPUs and Intel Xeon Phis, have become the workhorses of high-performance computing. Typically, the accelerators act as co-processors, with discrete memory spaces. They possess massive parallelism, along with many other unique architectural features. In order to obtain high …
-
JITB : a back end for just-in-time compilers
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
-
Characterizing the Effectiveness of Compilers in Vectorizing Polyhedrally Transformed Code
… tiling schemes namely, PLuTo and PTile, with two compilers namely, the GNU C Compiler and the Intel C Compiler.
-
Evaluation of Programs and Parallelizing Compilers Using Dynamic Analysis Techniques
The dynamic evaluation of parallelizing compilers and the programs to which they are applied is a field of abundant opportunity. Observing the dynamic behavior of a program provides insights into the structure of a computation that may be unavailable by static analysis methods.
-
Understanding and simplifying bug-inducing inputs for deep-learning compilers
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2026-05-01
-
Compilers for portable programming of heterogeneous parallel & approximate computing systems
Programming heterogeneous systems such as the System-on-chip (SoC) processors in modern mobile devices can be extremely complex because a single system may include multiple different parallelism models, instruction sets, memory hierarchies, and systems use different combinations of these features. …
-
A comparison of designs for extensible and extension-oriented compilers
… they program. For instance, system-specific compilers and errors in Linux and other systems, and add support for specialized control flow to Qt and event-based programs. These compilers are difficult to build and cannot always understand each other's language changes. However, they can …
-
Splash-2 shared-memory architecture for supporting high level language compilers
… CCM to promote the development and usage of HLL compilers for CCM systems.
-
Java Performance of the Rijndael Encryption Algorithm Across Compilers and Virtual Machines
… implementation is measured across fifteen compilers and fourteen virtual machines. Through analysis of these benchmarks, the Java performance of the Rijndael algorithm across compilers and virtual machines is produced.</p>
-
Effectiveness of program transformations and compilers for directive-based GPU programming models
… and machine independent notation and use compilers to transform CPU programs to heterogeneous form either automatically or relying on directives from the programmer. These compilers can offer the benefits of code portability and increased programmer productivity without imposing much …
Page 1 of 13