Search Constraints

Start Over
Filtering by: Dspace Collection Electronic Theses and Dissertations Remove constraint Dspace Collection: Electronic Theses and Dissertations Advisor Bose, Bella Remove constraint Advisor: Bose, Bella Committee Member Nguyen, Thinh Remove constraint Committee Member: Nguyen, Thinh

Search Results

  • On shortest disjoint paths and Hamiltonian cycles in some interconnection networks

    Creator:
    Hussain, Zaid
    Abstract:
    Parallel processors are classified into two classes: shared-memory multiprocessors and distributed- memory multiprocessors. In the shared-memory system, processors communicate through a common memory unit. However, in the distributed multiprocessor system, each processor has its own memory unit and the communications among the processors are performed through an interconnection network. Thus,...
    Resource Type:
    Dissertation
    Full Text:
    Disjoint Paths and Hamiltonian Cycles in Some Interconnection Networks by Zaid Hussain A DISSERTATION

  • Diversity combining ARQ over the m(> 2)-ary unidirectional channel

    Creator:
    Elarief, Noha
    Abstract:
    In diversity combining automatic repeat request (ARQ), erroneous packets are combined together forming a single, more reliable, packet. In this thesis, we give a diversity combining scheme for the m-ary unidirectional channel. A system using the given scheme with a t-unidirectional error detecting code is able to correct up to...
    Resource Type:
    Masters Thesis
    Full Text:
    of the School of Electrical Engineering and Computer Science Dean of the Graduate School I

  • Gray codes and their applications

    Creator:
    Anantha, Madhusudhanan
    Abstract:
    An n-bit Gray code is an ordered set of all 2n binary strings of length n. The special property of this listing is that Hamming distance between consecutive vectors is exactly 1. If the last and first codeword also have a Hamming distance 1 then the code is said to...
    Resource Type:
    Dissertation
    Full Text:
    then the code is said to be cyclic. This dissertation addresses problems dealing with the design and

  • On edge disjoint Hamiltonian cycles in torus and Gaussian networks

    Creator:
    Alazemi, Fawaz M.
    Abstract:
    Many algorithms in parallel systems can be easily solved if we can generate a Hamiltonian cycle on the underly network. Finding Hamiltonian cycle is a well known NP-complete problem. For specific instances of regular graphs, such as Torus and Gaussian network, one can easily find Hamiltonian cycles. In this thesis,...
    Resource Type:
    Masters Thesis
    Full Text:
    Hamiltonian Cycles in Torus and Gaussian Network Abstract approved: Bella Bose Many algorithms in parallel

  • Limited magnitude error control codes

    Creator:
    Elarief, Noha
    Abstract:
    A relatively new model of error control is the limited magnitude error over high radix channels. In this error model, the error magnitude does not exceed a certain limit known beforehand. In this dissertation, we study systematic error control codes for common channels under the assumption that the maximum error...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Noha Elarief for the degree

  • Some communication algorithms for Gaussian and Eisenstein-Jacobi networks

    Creator:
    Albader, Bader
    Abstract:
    Interconnection networks play important roles in designing high performance computers. Recently two new classes of interconnection networks based on the concept of Gaussian and Eisenstein-Jacobi integers were introduced. In this research, efficient routing and broadcasting algorithms for these networks are developed. Furthermore, constructing edge disjoint Hamiltonian cycles in Gaussian networks...
    Resource Type:
    Dissertation
    Full Text:
    and broadcasting algorithms for these networks are developed. Furthermore, constructing edge