Search Constraints

Start Over
Filtering by: Creator O'Neill, Larry W. Remove constraint Creator: O'Neill, Larry W. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella

Search Results

  • Offloading of I/O transactions in current CPU architectures

    Creator:
    Larsen, Steen K.
    Abstract:
    IO transactions within a computer system have evolved along with other system components (i.e., CPU, memory, video) from programmed IO (PIO). In current mainstream systems (spanning from HPC to mobile) the IO transactions are CPU-centric descriptor-based DMA transactions. The key benefit is that slower IO devices can DMA write system...
    Resource Type:
    Dissertation
    Full Text:
    presented on March 5, 2015. Title: O�oading of I/O Transactions in Current CPU Architectures Abstract

  • A pipelined baseband digital predistortion architecture for RF amplifier linearization

    Creator:
    Xu, Xiangqing
    Abstract:
    This thesis describes the design of a baseband digital predistortion architecture for radio frequency (RF) amplifier linearization. Existing amplifier linearization techniques are first examined. The nonlinearity of an amplifier can be characterized as amplitude-to-amplitude distortion and amplitude-to-phase distortion. The distortion can be corrected by providing a predistorted driver signal (both...
    Resource Type:
    Masters Thesis
    Full Text:
    3.9 Interchanges between modes 38 3.10 Micro-operation diagram 39 3.11 The controller 41 3.12

  • Advanced separation of concerns and the compatibility of aspect-orientation

    Creator:
    Dechow, Doug
    Abstract:
    The appropriate separation of concerns is a fundamental engineering principle. A concern, for software developers, is that which must be represented by code in a program; by extension, separation of concerns is the ability to represent a single concern in a single appropriate programming language construct. Advanced separation of concerns...
    Resource Type:
    Dissertation
    Full Text:
    Separation of Concerns ...............39 2.8 MultiDimensional Separation of Concerns .................40

  • Maximum flow in planar digraphs

    Creator:
    Harutyunyan, Anna
    Abstract:
    Worst-case analysis is often meaningless in practice. Some problems never reach the anticipated worst-case complexity. Other solutions get bogged down with impractical constants during implementation, despite having favorable asymptotic running times. In this thesis, we investigate these contrasts in the context of finding maximum flows in planar digraphs. We suggest...
    Resource Type:
    Masters Thesis
    Full Text:
    planar graphs is an augmenting- paths algorithm with O(n) iterations. Using dynamic trees, each

  • Design and implementation of an advanced GUI for the Petri Net Editor

    Creator:
    Qazi, Sanjeev
    Abstract:
    The problem addressed in this paper is that of usability of the Petri Net Editor used to create applications in the Objex framework. This editor puts a lot of burden on the user, in that the user needs to remember all the GUI resources previously created for the application, has...
    Resource Type:
    Capstone Project
    Full Text:
    classes. The total number of methods for these classes are 39. Modifications and additions have been

  • Parallax : an implementation of ELGDF (Extended Large Grain Data Flow)

    Creator:
    Kim, Inkyu
    Abstract:
    The major obstacle to widespread parallel programming of multiprocessors is the lack of a convenient parallel programming system. PPSE (Parallel Programming Support Environment) is a unified approach to parallel programming. Parallax is developed as a component of PPSE based on ELGDF which is a graphical language for designing parallel programs....
    Resource Type:
    Capstone Project
    Full Text:
    0 (.,,o\. Go Down Pipe ~ Bridge Node Fig. 4.9 Palette 39 40 4.2.1 Manipulation tools

  • LacEDAemon : a programming environment for the multiparadigm language leda

    Creator:
    Pandey, Rajeev K.
    Abstract:
    Multiparadigm programming languages are a recent development in the realm of programming languages. A multiparadigm programming language allows the use of multiple, differing programming paradigms without departing from a single, unified linguistic framework. Multiparadigm programming languages are claimed to have benefits to both pedagogy and complex application creation. The beneficial...
    Resource Type:
    Dissertation
    Full Text:
    and tight control integration, as well as data integration, using existing, o�-the-shelf tools

  • Optimal load and resource balance in internet distributed systems

    Creator:
    Nishida, Hiroshi
    Abstract:
    A distributed system is a network of multiple autonomous computational nodes designed primarily for performance scalability and robustness. The performance of a distributed system depends critically on how tasks and resources are distributed among the nodes. Thus, a main thrust in distributed system research is to design schemes for distributing...
    Resource Type:
    Dissertation
    Full Text:
    . Thus, any node can be located with O(m) steps. In P2P networks, a node consists of peers. Each peer is

  • Meeting End-to-End Deadlines in Real-Time Networks Using Software Defined Networking (SDN)

    Creator:
    Almahdi, Rafid M.
    Abstract:
    Network flows in Real-Time (RT) systems need to meet stringent end-to-end deadlines in order for such systems to operate safely and reliably. Today, such systems use custom or domain specific network system designs to meet end-to-end deadlines and other constraints of real-time flows. In this work we explore the design...
    Resource Type:
    Dissertation
    Full Text:
    Switch . . . . . . . . . . . . . . . . . . . . . . . . . . 39 3 Single Boost at Switch

  • A Java based mobile wireless messaging model

    Creator:
    Prabhu, Ramya
    Resource Type:
    Capstone Project
    Full Text:
    ......................................................... 38 4.7 Scenarios ........................................................................... 39