Search Constraints

Start Over
Filtering by: Creator Hoy, M. T. Remove constraint Creator: Hoy, M. T. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella

Search Results

  • Network Abnormalities in Routerless Networks on Chip

    Creator:
    Gambord, Ryan T.
    Abstract:
    Routerless networks on chip (NoCs) were recently introduced as an alternative to traditional mesh-based scalable networks, promising improved performance and scalability with a large decrease in power and area usage by the elimination of routing on in-flight packets. Without mitigation, most network designs, including routerless, are susceptible to loss of...
    Resource Type:
    Masters Thesis
    Full Text:
    threshold is indicative that measurements are close to true steady state conditions as t → ∞. In all cases

  • Information Theoretical Analysis of Self-Similar Trees

    Creator:
    Chunikhina, Evgenia V.
    Abstract:
    Tree-like patterns are ubiquitous in nature. Botanical trees, river networks, and blood systems are the most well-known examples of complex hierarchical systems met in observations. Interestingly, many of such systems exhibit statistical self-similarity. There are two main types of self-similarity: Horton self-similarity and Tokunaga self-similarity. Although there is an increased...
    Resource Type:
    Dissertation
    Full Text:
    : Information Theoretical Analysis of Self-Similar Trees Abstract approved: Juan M. Restrepo Tree-like

  • Cluster partitioning approaches to parallel Monte Carlo simulation on multiprocessors

    Creator:
    Ranawake, Udaya A.
    Abstract:
    We consider the parallelization of Monte Carlo algorithms for analyzing numerical models of charge transport used in semiconductor device physics. Parallel algorithms for the standard k-space Monte Carlo simulation of a three band model of bulk GaAs on hypercube multicomputers are first presented. This Monte Carlo model includes scattering due...
    Resource Type:
    Dissertation
    Full Text:
    . M. Lenders We consider the parallelization of Monte Carlo algorithms for analyzing nu- merical

  • Coding Techniques for Achieving Efficient Wireless Sensor Networks

    Creator:
    Qassim, Yousef M.
    Abstract:
    In this dissertation, we explored multiple coding techniques to reduce energy consumption, improve performance, and secure wireless sensor networks specifically and ad-hoc networks in general. With the introduction of Internet of Things (IoT) and 5G technologies, wireless sensor networks are quickly emerging as an important and key technology in the...
    Resource Type:
    Dissertation
    Full Text:
    reliability. In [5] the Poisson distribution is used to model the reliability Rk(t) to define the probability

  • 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:
    D tp s′,s. This can be computed as: Dtps′,s = D t s′,s +D p s′,s′ 4.2.4 Processing and Queuing

  • Electra : integrating constraints, condition-based dispatching, and features exclusion into the multiparadigm language Leda

    Creator:
    Zamel, Nabil M.
    Abstract:
    Multiparadigm languages are languages that are designed to support more than one style of programming. Leda is a strongly-typed multiparadigm programming language that supports imperative, functional, object-oriented, and logic programming. The constraint programming paradigm is a declarative style of programming where the programmer is able to state relationships among some...
    Resource Type:
    Dissertation
    Full Text:
    Nabil M. Zamel for the degree of Doctor of Philosophy in Computer Science presented on December 6

  • AOPS : an abstraction oriented programming system for literate programming

    Creator:
    Shum, Stephen M.
    Abstract:
    The practice of literate programming is not widespread because existing literate programming systems have some undesirable characteristics such as programming language and text processor dependence and lack of flexible tools for viewing and manipulation of the source file. This dissertation describes the literate programming system AOPS (Abstraction Oriented Programming System)...
    Resource Type:
    Dissertation
    Full Text:
    literate programming AN ABSTRACT OF THE THESIS OF Stephen M. Shum for the degree of Doctor of Philosophy

  • A multiprocessor node for communication and control

    Creator:
    Atluri, Venkata Ram
    Abstract:
    This paper describes the design and implementation of "A multiprocessor node for communication and control" (MPCC). MPCC is a high speed, high performance local area network capable of performing real time control tasks. This is achieved by the concurrent operation of two 8051 microcontrollers, a dual port RAM and the...
    Resource Type:
    Masters Thesis
    Full Text:
    Prof. John M. Murray and Prof. John Peterson for acting as my committee members and giving me useful

  • Efficient decoder design for error correction codes

    Creator:
    He, Jinjin
    Abstract:
    Error correction codes (ECCs) have been widely used in communication systems and storage devices. Nowadays, the rapid development of integrated circuit technologies makes feasible the implementation of powerful ECCs such as turbo code and low-density parity-check (LDPC) code. However, these high-performance codes require complex decoding algorithms, resulting in large hardware...
    Resource Type:
    Dissertation
    Full Text:
    scheme by applying T -algorithm on branch metrics (BMs) is proposed for the Viterbi decoder (VD

  • 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:
    iteration can be imple­ mented in O(log n) time. Long before, Itai and Shiloach showed that when s and t