Search Constraints

Start Over
Filtering by: Creator Gupta, M. Remove constraint Creator: Gupta, M. Subject Parallel processing (Electronic computers) Remove constraint Subject: Parallel processing (Electronic computers)

Search Results

  • Multithreaded virtual processor on DSM

    Creator:
    An, Ho Seok
    Abstract:
    Modern superscalar processors exploit instruction-level parallelism (ILP) by issuing multiple instructions in a single cycle because of increasing demand for higher performance in computing. However, stalls due to cache misses severely degrade the performance by disturbing the exploitation of ILP. Multiprocessors also greatly exacerbate the memory latency problem. In SMPs,...
    Resource Type:
    Masters Thesis
    Full Text:
    thanks to the committee members, Prof. Alexandre F. Tenca, Prof. Kyoung Rok Cho, and Prof. Robert M

  • Design of high-speed summing circuitry and comparator for adaptive parallel multi-level decision feedback equalization

    Creator:
    Gao, Hairong
    Abstract:
    Multi-level decision feedback equalization (MDFE) is an effective sampled signal processing technique to remove inter-symbol interference (ISI) from disk read-back signals. Parallelism which doubles the symbol rate can be realized by utilizing the characteristic of channel response and decision feedback equalization algorithm. A mixed-signal IC implementation has been chosen for...
    Resource Type:
    Masters Thesis
    Full Text:
    Forejt, Ravi Gupta, Ramsin Ziazadeh, Bo Wang, Yunteng Huang, Jianjun Zhou and many others for many

  • A block method approach to solving the Laplace equation on a parallel computer

    Creator:
    Hitchcock, Paula Ann
    Abstract:
    This paper continues exploration in the area of programming for parallel computers. The appendix to the paper contains an extensive survey of the literature related to parallel computers and parallel programming techniques. The paper itself presents a new approach to solving the Laplace equation on a. parallel computer. A new...
    Resource Type:
    Masters Thesis
    Full Text:
    - place equation, (2.1.1) 3 2 2 m , 9 2 u ax ay 2 = on the rectangle D = {(x,y) 0 < x < a, 0 < y < b

  • Resource placement, data rearrangement, and Hamiltonian cycles in torus networks

    Creator:
    Bae, Myung Mun
    Abstract:
    Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is...
    Resource Type:
    Dissertation
    Full Text:
    = 3 and k is odd 76 5.4 n = 3 and k is even 84 5.5 n = 2m, and m > 2 86 5.6 n = 2m + 1, m > 1

  • Data decomposition and load balancing for networked data-parallel processing

    Creator:
    Crandall, Phyllis E.
    Resource Type:
    Dissertation
    Full Text:
    transmission. F Number of header and trailer bytes in the data transmission frame. M Maximum data bytes in a

  • Embeddings in parallel systems

    Creator:
    Kwon, Younggeun
    Resource Type:
    Dissertation
    Full Text:
    nodes in level L+1 : (L+1, xk_i...xL+1 a x1,4 x1 m), for a = 0, 1,... s-1 if L < h, and to the

  • Simulation studies of routing algorithms for multicomputer systems

    Creator:
    Choi, Jangmin
    Abstract:
    Efficient routing of messages is critical to the performance of multicomputers. Many adaptive routing algorithms have been proposed to improve the network efficiency; however, they can make only short-sighted decisions to choose a channel for message routing because of limited information about network condition. The short-sighted decisions may cause unnecessary...
    Resource Type:
    Masters Thesis
    Full Text:
    ability of a network to be modularly expandable with increasing machine resources. 4 M M II.M P

  • Scheduling non-uniform parallel loops on MIMD computers

    Creator:
    Liu, Jie
    Abstract:
    Parallel loops are one of the main sources of parallelism in scientific applications, and many parallel loops do not have a uniform iteration execution time. To achieve good performance for such applications on a parallel computer, iterations of a parallel loop have to be assigned to processors in such a...
    Resource Type:
    Dissertation
    Full Text:
    , let M be a parallel machine that has P processors denoted as {pi , p2, , pp}. N, P, and e(ti) are

  • Allocation of SISAL program graphs to processors using BLAS

    Creator:
    Raisinghani, Manoj H.
    Abstract:
    There are a number of well known techniques for extracting parallelism from a given program. They range from hardware implementations, building restructuring compilers or reorganizing of programs so as to specify all the available parallelism. The success rate of any of the known techniques is rather poor over all types...
    Resource Type:
    Masters Thesis
    Full Text:
    , interconnection networks are classified into Static or Dynamic networks. 10 -.11-..- -00-1111 M M M M

  • High-performance data-parallel input/output

    Creator:
    Moore, Jason Andrew
    Abstract:
    Existing parallel file systems are proving inadequate in two important arenas: programmability and performance. Both of these inadequacies can largely be traced to the fact that nearly all parallel file systems evolved from Unix and rely on a Unix-oriented, single-stream, block-at-a-time approach to file I/O. This one-size-fits-all approach to parallel...
    Resource Type:
    Dissertation
    Full Text:
    Jason A. Moore presented on July 19, 1996 APPROVED: M jor Professor, representing Computer Science