Search Constraints

Start Over
Filtering by: Creator Paulson, C. A. Remove constraint Creator: Paulson, C. A. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella Subject Computer architecture Remove constraint Subject: Computer architecture

Search Results

  • The dynamic speculation and performance prediction of parallel loops

    Creator:
    Zier, David A.
    Abstract:
    General purpose computer systems have seen increased performance potential through the parallel processing capabilities of multicore processors. Yet this potential performance can only be attained through parallel applications, thus forcing software developers to rethink how everyday applications are designed. The most readily form of Thread Level Parallelism (TLP) within any...
    Resource Type:
    Dissertation
    Full Text:
    overhead, and irregular loop structures. c©Copyright by David A. Zier May 1, 2009 All Rights Reserved

  • 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:
    the Vertex operating system. As the node programs can access the C I/O library, it is easier to use a

  • Optimizing the advanced encryption standard on Intel's SIMD architecture

    Creator:
    Godbole, Pankaj
    Abstract:
    The Advanced Encryption Standard (AES) is the new standard for cryptography and has gained wide support as a means to secure digital data. Hence, it is beneficial to develop an implementation of AES that has a high throughput. SIMD technology is very effective in increasing the performance of some cryptographic...
    Resource Type:
    Masters Thesis
    Full Text:
    conditions: 1. closed : Va, bin G, a+bis also in G 2. associative :Va,b,cinG,(a+b)+c=a+(b+c) 3

  • 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:
    three equations: tii, j) = i + j; for 0 ..'c. i, j N A piecewise affine schedule can also be found for