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 39 for “"Compilers (Computer programs)"”.
-
The implementation of an optimizing compiler for Icon.
… that can be applied while translating Icon programs. These optimizations and the analyses needed to apply them are of interest for two reasons. First, Icon's unique combination of characteristics requires developing new techniques for implementing them. Second, these optimizations are used …
-
Analysis and application of Fourier-Motzkin variable elimination to program optimization : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science at Massey University, Albany, New Zealand
… analysis techniques in use by optimizing compilers: Fourier-Motzkin Variable Elimination, the Banerjee Bounds Test, the Omega Test, and the I-Test. Although the performance and effectiveness of these tests have previously been documented empirically, no in-depth analysis of how these …
-
Braids: out-of-order performance with almost in-order complexity
There is still much performance to be gained by out-of-order processors with wider issue widths. However, traditional methods of increasing issue width do not scale; that is, they drastically increase design complexity and power requirements. This dissertation introduces the braid, a compile-time …
-
Performance improvement through predicated execution in VLIW machines / Morteza Biglari-Abhari.
Investigates techniques to achieve performance improvement in Very Long Instruction Word machines through predicated execution.
-
An optimizing code generator generator.
… chop reads nonprocedural descriptions of a computer's instruction set and of a naive code generator for the computer, and it writes an integrated code generator and peephole optimizer for it. The resulting code generators are very efficient because they interpret no tables; they are …
-
Correct implementation of network protocols
… icantly more difficult than other areas of computer programming: problems with time, concurrency, and failures; interactions between the network proto- col and its environment; and obstacles in developing the protocol over time. In order to address these issues, we introduce the Timed …
-
Inserting fences to guarantee sequential consistency
… (M.S.)--Michigan State University. Department of Computer Science and Engineering, 2002
-
Incorporating domain-specific information into the compilation process
… many advances in compiler research, traditional compilers continue to suffer from one significant limitation: they only recognize the low-level primitive constructs of their languages. In contrast, programmers increasingly benefit from higher level software components, which implement a variety …
-
Profile-guided redundancy elimination
Program optimisations analyse and transform the programs such that better performance results can be achieved. Classical optimisations mainly use the static properties of the programs to analyse program code and make sure that the optimisations work for every possible combination of the program and …
-
Matrix-based restructuring compilers
… D.)--Michigan State University. Department of Computer Science, 1999
-
Automated Verification of Compiler Transformations
… it increasingly challenging to develop reliable compilers that preserve the semantics of source code during compilation. Traditional testing methods often lack sufficient test coverage and fail to identify subtle errors and undefined behaviors that can lead to compiler malfunctions. Furthermore, …
-
Scalable data redistribution services for distributed-memory machines
… D.)--Michigan State University. Department of Computer Science, 1995
-
Using Intrinsically-Typed Definitional Interpreters to Verify Compiler Optimizations in a Monadic Intermediate Language
… critical to the efficiency of modern functional programs. At the same time, optimizations that unintentionally change the semantics of programs can systematically introduce errors into programs that pass through them. The question of how to best verify that optimizations and other program …
-
Implementing a Functional Logic Programming Language via the Fair Scheme
… This combination allows one to write hybrid programs in which the programmer may move between declarative and non-declarative styles with relative ease. Benchmarking data show Sprite to be more complete than other Curry systems and competitive in terms of execution time, particularly for …
-
Specification-Driven Optimization
… optimizing transformations have been built into compilers. The end-user has little or no control over guiding any optimizations that may be applied by the compiler. Moreover, the compiler-writer does not have a simple way to direct the optimizations. Thus, many potentially beneficial …
-
Compiler directed speculation for embedded clustered EPIC machines
Very Large Instruction Word (VLIW)/Explicitly Parallel Instruction Computing (EPIC) processors are a very attractive platform for many of today's multimedia and communications applications. In particular, clustered VLIW/EPIC machines can take aggressive advantage of the available instruction level …
-
Language and compiler support for mixin programming
The need to reduce the cost of software development and maintenance has been a constant and overriding concern since the advent of electronic computing. The difficulty, and therefore the expense, in programming large software applications is due to the complex interactions and interdependencies in …
Page 1 of 2