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 74 for “"Compile time"”.

  1. An Interactive Compile-Time Diagnostic System

    Made available in DSpace on 2014-12-13T18:01:46Z (GMT). No. of bitstreams: 1 7606989.pdf: 4370665 bytes, checksum: 1bcf92f5a028ada6711d99ed4880e79e (MD5) Previous issue date: 1975

    uiuc Repository record for An Interactive Compile-Time Diagnostic System (opens in a new tab)

  2. Developing Embedded Software Using Compile-Time Virtualisation

    … inline low-level coding. This thesis describes Compile-Time Virtualisation (CTV), a virtualisation-based technique for assisting the mapping of general-purpose software onto complex hardware. CTV introduces the Virtual Platform, an idealised view of the underlying hardware that presents a …

    whiterose Repository record for Developing Embedded Software Using Compile-Time Virtualisation (opens in a new tab)

  3. Compile -Time Memory Disambiguation for C Programs

    … Due to its modular feature, the amounts of time and memory requirements are greatly reduced. The dissertation also evaluates the effectiveness of the proposed algorithm on the complete SPECcint92 and SPECcint95 benchmark suites. Significant performance improvements are observed from these …

    uiuc Repository record for Compile -Time Memory Disambiguation for C Programs (opens in a new tab)

  4. Compile -Time Performance Prediction of Scientific Programs

    We use stack distances to quantify locality and we show that the average locality computed using stack distances is a very reliable metric. A new algorithm for stack processing, that is 30% faster than the best know algorithm on the suite of programs traced, is also presented.

    uiuc Repository record for Compile -Time Performance Prediction of Scientific Programs (opens in a new tab)

  5. Compile-Time Analysis of Explicitly Parallel Programs

    … language, but also invalidates most current compiler techniques for program analyses and optimizations. The problem stems from the inadequacy of control flow graphs to describe information flows in a parallel program, and the insufficiency of data dependences and control dependences to …

    uiuc Repository record for Compile-Time Analysis of Explicitly Parallel Programs (opens in a new tab)

  6. Strongly typed, compile-time safe and loosely coupled data persistence

    … have not been particularly concerned with compile-time type safety. Type mismatch errors between program and the database schema occur quite often during program development, and the techniques used in these approaches often defer error checking on database operations until runtime. In this …

    birmingham Repository record for Strongly typed, compile-time safe and loosely coupled data persistence (opens in a new tab)

  7. Integrating compile-time and runtime parallelism management through revocable thread serialization

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.

    mit Repository record for Integrating compile-time and runtime parallelism management through revocable thread serialization (opens in a new tab)

  8. Memory Allocation for Embedded Systems with a Compile-Time-Unknown Scratch-Pad Size

    … scratch-pad memory(SPM) whose size is unknown at compile-time. All existing memory allocation schemes for SPM require the SPM size to be known at compile-time; therefore tie the resulting executable to that size of SPM and not portable to other platforms having different SPM sizes. As …

    maryland Repository record for Memory Allocation for Embedded Systems with a Compile-Time-Unknown Scratch-Pad Size (opens in a new tab)

  9. Newton : a language for describing physics

    … invariants in software automatically, each compiler of the language used for every sensor platform could be modified to be aware of different sets of invariants in the programs it compiles, or the compilers could take in a configuration file that describes these invariants. This MEng thesis …

    mit Repository record for Newton : a language for describing physics (opens in a new tab)

  10. Compiler Directed Memory Management for Numerical Programs

    … related problems are solved partially at compile time, where memory directives are inserted into the object code of a compiled program. The main objectives of memory directives are to determine the memory requirements of a program at compile time and to pass this information to the …

    uiuc Repository record for Compiler Directed Memory Management for Numerical Programs (opens in a new tab)

  11. Managing interprocedural optimization

    … the context available to the optimizing compiler, and it enables programmers to use procedure calls without the concern of hurting execution time. While important, interprocedural optimization can introduce some significant compile-time costs. When interprocedural information is used to …

    rice Repository record for Managing interprocedural optimization (opens in a new tab)

  12. Compiler-assisted rollback recovery

    This thesis examines the feasibility of applying compile-time information to assist in rollback recovery. Depending on the configuration of the original system, one or more of the following three compiler capabilities are applied: (1) code insertion, (2) code analysis, and (3) code transformation.

    uiuc Repository record for Compiler-assisted rollback recovery (opens in a new tab)

  13. A hybrid static/dynamic approach to scheduling stream programs

    … dependencies between actors. In StreamIt, the compiler analyzes data dependencies between actors at compile-time and generates a static schedule that determines where and when actors are executed on the available cores. Statically scheduling actors onto cores results in no scheduling overhead …

    mit Repository record for A hybrid static/dynamic approach to scheduling stream programs (opens in a new tab)

  14. Interactive Source -Level Debugging of Optimized Code

    … framework has been prototyped in both the IMPACT compiler and an experimental debugger. Experiments conducted on several integer benchmark programs have yielded encouraging results. The overhead in executable file size and compile time incurred by this framework is reasonable. Compared with …

    uiuc Repository record for Interactive Source -Level Debugging of Optimized Code (opens in a new tab)

  15. Conjunctive polymorphic type checking with explicit types

    An expressive type language and the ability to do compile-time type inference are desirable goals in language design, but the attainment of the former may preclude the possibility of the latter. Specifically, the type conjunction operator (type intersection) induces a rich type language at the …

    vt Repository record for Conjunctive polymorphic type checking with explicit types (opens in a new tab)

  16. Mutation analysis of dynamically typed programs

    … In these languages, types are not checked at compile-time. Type errors must be found by testing and in general, programs written in these languages require additional testing compared to statically typed languages.Mutation analysis (or mutation testing) has been shown to be effective in …

    hull Repository record for Mutation analysis of dynamically typed programs (opens in a new tab)

  17. Dynamic Module Library Generation for FPGA-based Run-Time Reconfigurable Systems

    … Gate Arrays (FPGAs) can implement entire run-time reconfigurable systems using partial reconfiguration. Module-based run-time reconfiguration permits the construction of custom applications at run-time using pre-compiled Intellectual Property (IP) from a module library. The need for both …

    vt Repository record for Dynamic Module Library Generation for FPGA-based Run-Time Reconfigurable Systems (opens in a new tab)

  18. Categorization and analyzing linked structures

    … that these two attributes can be determined at compile-time by augmenting any store-based analysis with heap reference counts and the missing link property. An analysis, which has the form of an abstract interpretation, is defined and implemented with the program generator Z1. The language …

    uiuc Repository record for Categorization and analyzing linked structures (opens in a new tab)

  19. PHDL : a Python Hardware Design framework

    … developers to write software to make intelligent compile time decisions far beyond the capabilities of current HDLs. e approach taken is to build PHDL on the Python scripting language and to build a component library suciently large to design a microprocessor. As an example a microprocessor is …

    mit Repository record for PHDL : a Python Hardware Design framework (opens in a new tab)

Page 1 of 4