Search Constraints

Start Over
Filtering by: Creator Duringer, J. M. Remove constraint Creator: Duringer, J. M. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella Non-Academic Affiliation Oregon State University. Graduate School Remove constraint Non-Academic Affiliation: Oregon State University. Graduate School

Search Results

  • 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:
    edges of the task graph that go between it and some other processor under the mapping M: CSq = {(i,j

  • 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:
    :} {16:}J:=1;K:=1;P[1]:=2;{:16} {18:}0RD:=2;SQUARE:=9;{:18} WHILE K<M DO BEGIN{14:}REPEAT J:= J +2; {20

  • 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

  • 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

  • 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:
    distortion in the power amplifier is essentially caused by amplitude variations, M. Faulkner (2) used the

  • Scheduling system of affine recurrence equations by means of piecewise affine timing functions

    Creator:
    Mui, Lap K.
    Abstract:
    Many systematic methods exist for mapping algorithms to processor arrays. The algorithm is usually specified as a set of recurrence equations, and the processor arrays are synthesized by finding timing and allocation functions which transform index points in the recurrences into points in a space-time domain. The problem of scheduling...
    Resource Type:
    Masters Thesis
    Full Text:
    . [EXAMPLE 1] Consider the SARE: f(i, j) = h(i, i) for i = j f(i, j) = f(i, j 1) for i < j (1.2) 3 f(i

  • 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:
    (Continued) Figure Page 3.9 Example of calculator nodes: j wants to download from i, then j inquires of i’s

  • Adiabatic Markov Decision Process : convergence of value iteration algorithm

    Creator:
    Duong, Thai
    Abstract:
    Markov Decision Process (MDP) is a well-known framework for devising the optimal decision making strategies under uncertainty. Typically, the decision maker assumes a stationary environment which is characterized by a time-invariant transition probability matrix. However, in many real-world scenarios, this assumption is not justified, thus the optimal strategy might not...
    Resource Type:
    Masters Thesis
    Full Text:
    ||vn0 − n0g ∗||∞ 1E ≤ + ∑ ∏ γk sp(vn0+1 − vn0 )n n i=n0 k=n0 i i−1 + Y M ei + 2 ∑ sp(v j)|ΔΦ j−1|(∏ γ

  • Parallel simplex algorithms and loop spreading

    Creator:
    Wu, Youfeng
    Abstract:
    Parallel solutions for two classes of linear programs are presented. First we parallelized the two-phase revised simplex algorithm and showed that it is possible to get linear improvement in performance. The simplex algorithm is the best known algorithm for solving linear programs, and we claim our result is the best...
    Resource Type:
    Dissertation
    Full Text:
    = 1, set phase = 2, q = m+ 1. For j = 1, ... , n, calculate Sj = uq * ai. step 2. Calculate Sk = min

  • Design and Analysis of Distributed Resource Allocation Techniques for Large-Scale Dynamic Spectrum Access Networks

    Creator:
    NoroozOliaee, MohammadJavad
    Abstract:
    The widespread use of wireless devices that we have recently been witnessing, such as smartphones, tablets, laptops, and wirelessly accessible devices in general, is causing an unprecedented growth in the required amount of the wireless radio spectrum. On the other hand, the spectrum resource has, for the last several decades,...
    Resource Type:
    Dissertation
    Full Text:
    = G) for m = 10, β = 2, and Vj/Q = 50 for j = 1, 2, . . . , 10