Search for dissertations about: "compiler design"
Showing result 1 - 5 of 36 swedish dissertations containing the words compiler design.
-
1. Finding and Exploiting Memory-Level-Parallelism in Constrained Speculative Architectures
Abstract : One of the main performance bottlenecks of processors today is the discrepancy between processor and memory speed, known as the memory wall. While the processor executes instructions at a high pace, the memory is too slow to provide data in a timely manner. READ MORE
-
2. NoGAP: Novel Generator of Accelerators and Processors
Abstract : ASIPs are needed to handle the future demand of flexible yet highperformance embedded computing. The flexibility of ASIPs makes them preferable over fixed function ASICs. Also, a well designed ASIP, has a power consumption comparable to ASICs. However the cost associated with ASIP design is a limiting factor for a more wide spread adoption. READ MORE
-
3. A Distributed Haskell for the Modern Web
Abstract : We present the design and implementation of a novel programming model andsoftware development suite for interactive, distributed web applications usingthe Haskell programming language.The suite includes the JavaScript-targeting Haste Haskell compilerwhich improves on the current state of the art by producing smaller and leanerJavaScript code while preserving compatibility with standard Haskell aswell as with the de facto standard GHC compiler. READ MORE
-
4. Programming Language Primitives and Tools for Integrated Real-Time Systems Development
Abstract : The correctness of real-time systems depends on both its logical and temporal correctness. Typically, real-time systems are developed in several steps. First, the application is divided into a number of recurrent tasks and implemented using a programming language. READ MORE
-
5. Rewritable Reference Attributed Grammars - design, implementation, and applications
Abstract : This thesis presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRAGs), is completely declarative and supports both rewrites and computations by means of attributes. READ MORE