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 271 for “"Compiling"”.

  1. Compiling Java for Real-Time Systems

    … In order to fulfill these key concepts, natively compiling Java using a revised memory management technique is proposed. We have implemented a compiler and run-time system for Java, using and evaluating new object-oriented compiler construction research tools, which enables a new way of …

    lund Repository record for Compiling Java for Real-Time Systems (opens in a new tab)

  2. Programming and Compiling for Distributed Architectures

    We also discuss a preliminary extension of OpenMP for distributed architecture. The compiler directives to describe the data distribution and communication are being designed. The extended OpenMP provides the hybrid programming model a standard interface to improve the flexibility and portability …

    uiuc Repository record for Programming and Compiling for Distributed Architectures (opens in a new tab)

  3. Compiling Vector Programs for SIMD Devices

    Made available in DSpace on 2015-09-25T20:20:14Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3242971.pdf: 3661089 bytes, checksum: 4441fcd295b39b414c7c04dc3713b189 (MD5) Previous issue date: 2006

    uiuc Repository record for Compiling Vector Programs for SIMD Devices (opens in a new tab)

  4. Compiling for coarse-grain reconfigurable architectures

    Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.

    mit Repository record for Compiling for coarse-grain reconfigurable architectures (opens in a new tab)

  5. Compiling methods for the Fresh Breeze processor

    The Fresh Breeze project is designing a new parallel architecture that is designed to serve as a model for high-performance computing while maintaining good software programming principles. One of the unique aspects of this architecture is a write-once memory model with hardware-based garbage …

    mit Repository record for Compiling methods for the Fresh Breeze processor (opens in a new tab)

  6. Compiling functional reactive macroprograms for sensor networks

    Sensor networks present a number of novel programming challenges for application developers. Their inherent limitations of computational power, communication bandwidth, and energy demand new approaches to programming that shield the developer from low-level details of resource management, …

    mit Repository record for Compiling functional reactive macroprograms for sensor networks (opens in a new tab)

  7. Compiling high-level scripting languages to performant code

    The popularity of data- and scientific-oriented applications, the abundance of on-demand compute resources, and the scarcity of domain expert programmers have given rise to high- level scripting languages. These high-level scripting languages offer a fast way to translate ideas into code, but tend …

    uiuc Repository record for Compiling high-level scripting languages to performant code (opens in a new tab)

  8. Compiling for parallel multithreaded computation on symmetric multiprocessors

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

    mit Repository record for Compiling for parallel multithreaded computation on symmetric multiprocessors (opens in a new tab)

  9. Compiling Fast Partial Derivatives of Functions Given by Algorithms

    If the gradient of the function y = f(x(,1),...,x(,n)) is desired where f is given by an algorithm Af(x,n,y), most numerical analysts will use numerical differencing. This is a sampling scheme that approximates derivatives by the slope of secants in closely spaced points. Symbolic methods that make …

    uiuc Repository record for Compiling Fast Partial Derivatives of Functions Given by Algorithms (opens in a new tab)

  10. Compiling Gallina to go for the FSCQ file system

    Over the last decade, systems software verification has become increasingly practical. Many verified systems have been written in the language of a proof assistant, proved correct, and then made runnable using code extraction. However, due to the rigidity of extraction and the overhead of the …

    mit Repository record for Compiling Gallina to go for the FSCQ file system (opens in a new tab)

  11. Compiling and optimizing spreadsheets for FPGA and multicore execution

    A major barrier to developing systems on multicore and FPGA chips is an easy-to-use development environment. This thesis presents the RhoZeta spreadsheet compiler and Catalyst optimization system for programming multiprocessors and FPGAs. Any spreadsheet frontend may be extended to work with …

    mit Repository record for Compiling and optimizing spreadsheets for FPGA and multicore execution (opens in a new tab)

  12. Compiling array computations for the Fresh Breeze Parallel Processor

    Fresh Breeze is a highly parallel architecture currently under development, which strives to provide high performance scientific computing with simple programmability. The architecture provides for multithreaded determinate execution with a write-once shared memory system. In particular, Fresh …

    mit Repository record for Compiling array computations for the Fresh Breeze Parallel Processor (opens in a new tab)

  13. Compiling reductions in data parallel programs for distributed memory multiprocessors

    Reduction recognition and optimization are crucial techniques in parallelizing compilers. They are used to detect the recurrences in a program and transform the originally sequential code into parallel code. Because of the expensive interprocessor communication cost, reduction recognition and …

    rice Repository record for Compiling reductions in data parallel programs for distributed memory multiprocessors (opens in a new tab)

  14. Compiling for Distributed Memory Multiprocessors Based on Access Region Analysis

    … techniques are used, including traditional compiling techniques and new techniques developed specifically with distributed memory architectures as the target. Combining these traditional and new techniques, various sequential benchmark programs are tested on one of the distributed memory …

    uiuc Repository record for Compiling for Distributed Memory Multiprocessors Based on Access Region Analysis (opens in a new tab)

  15. An empirical study of a novel technique : rationed-memory compiling

    We present rationed-memory compiling, a new technique designed to reduce the memory consumption of programs. The technique lowers memory usage by decreasing the amount of memory that programs allocate, but not use actively. With rationed- memory compiling, whenever a program requests a memory …

    mit Repository record for An empirical study of a novel technique : rationed-memory compiling (opens in a new tab)

  16. Designing and compiling functional Java for the Fresh Breeze architecture

    … design choices have significant implications for compiling for the architecture. In particular, Fresh Breeze uses immutable, fixed-size memory chunks rather than sequential, mutable memory to store data [1][2][3]. This work demonstrates Functional Java, a subset of the Java language that one can …

    mit Repository record for Designing and compiling functional Java for the Fresh Breeze architecture (opens in a new tab)

  17. COMPILING AND DETECTING TYPE ERRORS IN INCOMPLETE JAVA PROGRAMS WITH GENERICS

    Incomplete programs are ubiquitous in web repositories, evolving software projects and beyond. However, they are difficult to work with as they contain references to undeclared constructs. Earlier efforts by the programming languages community have offered solutions to this problem across several …

    nus Repository record for COMPILING AND DETECTING TYPE ERRORS IN INCOMPLETE JAVA PROGRAMS WITH GENERICS (opens in a new tab)

  18. Compiling Haskell into Lean: A Common Abstract Syntax for Haskell and Interactive Theorem Provers

    <p>In this work, we introduce a program conversion tool, HS-TO-LEAN, that uses GHC's <em>ghc-lib-parser</em> API to translate Haskell programs into Lean code, which is then validated by the Lean compiler. The repo can be found at https://github.com/holcombet/hs-to-lean/tree/main. The result is a …

    chapman Repository record for Compiling Haskell into Lean: A Common Abstract Syntax for Haskell and Interactive Theorem Provers (opens in a new tab)

  19. Expanding the Corpus of Vocalized Hebrew Text: Compiling an Unvocalized Text Corpus and Building an Online Interface for Vocalization Annotation

    <p>Written modern Hebrew presents a unique challenge for training computational models for language processing because modern Hebrew text often lacks vocalization. The lack of available vocalized Hebrew data can lead to ambiguity in training these models and generally hinders work on natural …

    cuny-grad Repository record for Expanding the Corpus of Vocalized Hebrew Text: Compiling an Unvocalized Text Corpus and Building an Online Interface for Vocalization Annotation (opens in a new tab)

Page 1 of 14