Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 11 of 11 for “"Parallel processing (Electronic computers)--Evaluation"”.

  1. Mapping Programs to Parallel Architectures in the Real World

    Mapping an application program to a parallel architecture can be described as a multidimensional optimization problem. To simplify the problem, we divide the overall mapping process into three sequential substeps: partitioning, allocating, and scheduling, with each step using a few details of the …

    portland-state Repository record for Mapping Programs to Parallel Architectures in the Real World (opens in a new tab)

  2. ParPlum : a system for evaluating parallel program optimization methods

    The diversity of application programs and parallel architectures makes the mapping problem complicated and hard to evaluate. The quality of mapping is machine and application dependent and varies due to inaccurate values of application and architecture characteristics. A system for developing, …

    portland-state Repository record for ParPlum : a system for evaluating parallel program optimization methods (opens in a new tab)

  3. Scalable event tracking on high-end parallel systems

    … performance problems that arise on these highly parallel systems. These high-end architectures contain tens to hundreds of thousands of processors, pushing application scalability challenges to new heights. Unfortunately, the collection of event-based data presents scalability challenges itself: …

    portland-state Repository record for Scalable event tracking on high-end parallel systems (opens in a new tab)

  4. Instrumentation system design, modeling, and evaluation

    Thesis (Ph. D.)--Michigan State University. Department of Electrical Engineering, 1997

    msu Repository record for Instrumentation system design, modeling, and evaluation (opens in a new tab)

  5. Quantifiability: Concurrent Correctness from First Principles

    Architectural imperatives due to the slowing of Moore's Law, the broad acceptance of relaxed semantics and the O(n!) worst case verification complexity of sequential histories motivate a new approach to concurrent correctness. Desiderata for a new correctness condition are that it be independent of …

    ucf Repository record for Quantifiability: Concurrent Correctness from First Principles (opens in a new tab)

  6. Multiprocessor scheduling with practical constraints

    The problem of scheduling tasks onto multiprocessor systems has increasing practical importance as more applications are being addressed with multiprocessor systems. Actual applications and multiprocessor systems have many characteristics which become constraints to the general scheduling problem …

    ucf Repository record for Multiprocessor scheduling with practical constraints (opens in a new tab)

  7. Waiting line problems and ada tasking

    … The comparison examines the accuracy, processing time requirements, and memory requirements for each of the implementations.

    ucf Repository record for Waiting line problems and ada tasking (opens in a new tab)

  8. Matrix Inversion in Single and Multi-processor Environments

    … network of transputers to show the advantages of parallel processing. The adjoint-determinant method of calculating the inverse was used. The software developed for the single transputer configuration was only slightly modified to execute on the multi-transputer network. The Transputer Development …

    ucf Repository record for Matrix Inversion in Single and Multi-processor Environments (opens in a new tab)

  9. A Reconfigurable Orthogonal Systolic Array Implementation of a Kalman Filter

    … equations in real time. The use of pipelined parallel architectures allows the Kalman filter equations to be realized with much greater efficiency than previous implementations. A reconfigurable, few instruction, multiple data, orthogonal, pipelined, systolic array processor will be used to …

    ucf Repository record for A Reconfigurable Orthogonal Systolic Array Implementation of a Kalman Filter (opens in a new tab)

  10. Application of extreme order statistics to the average-case analysis of parallel algorithms

    … of discrete methods to the analysis of parallel algorithms for distributed memory multicomputers. This analysis requires the determination of the maximum time required by concurrently executing sequential procedures. Two merging algorithms for a linear array are analyzed for worst-case …

    ucf Repository record for Application of extreme order statistics to the average-case analysis of parallel algorithms (opens in a new tab)

  11. Some Optimally Adaptive Parallel Graph Algorithms on EREW PRAM Model

    … situations. The commercial availability of parallel computers have led to the development of efficient parallel graph algorithms. Using an exclusive-read and exclusive-write (EREW) parallel random access machine (PRAM) as the computation model with a fixed number of processors, we design and …

    ucf Repository record for Some Optimally Adaptive Parallel Graph Algorithms on EREW PRAM Model (opens in a new tab)