Search Constraints

Start Over
Filtering by: Creator Spyridakis, Dimitri E. Remove constraint Creator: Spyridakis, Dimitri E. Committee Member Lee, Ben Remove constraint Committee Member: Lee, Ben

Search Results

  • 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:
    networks. A graph is an ordered pair G = (V,E) where V is a finite set of vertices (also called nodes) and

  • 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:
    ), it does not fulfill 0.0 ≤ x2 ≤ 0.5. • Therefore, b queries a peer e in E. • Since zone E satisfies

  • Leakage power minimization by considering self-bias transistor and pin reordering technique

    Creator:
    Gopalakrishnan, Harish
    Abstract:
    Recent trends in CMOS technology and scaling of devices clearly indicate that leakage power in digital circuits would be crucial and largely depend on the sub-threshold current. Minimizing leakage is gaining increasing importance along with other critical design aspects primarily due to the growing demand for portable battery-operated electronic devices...
    Resource Type:
    Masters Thesis
    Full Text:
    Discharge Figure 5: Load capacitor (dis)charge current and voltage [2] 11 EDD and E can be derived by

  • Interconnection Networks Based on Gaussian and Eisenstein-Jacobi Integers

    Creator:
    Shamaei, Arash
    Abstract:
    Quotient rings of Gaussian and Eisenstein-Jacobi(EJ) integers can be deployed to construct interconnection networks with good topological properties. In this thesis, we propose deadlock-free deterministic and partially adaptive routing algo­rithms for hexagonal networks, one special class of EJ networks. Then we discuss higher dimensional Gaussian networks as an alternative to...
    Resource Type:
    Dissertation
    Full Text:
    by a routing algorithm. The resource dependence graph can be defined as a directed graph G = (V,E