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 6 of 6 for “"sparse data structure"”.

  1. A model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality

    Sparse matrix vector multiply (SpMV) is an important computation that is used in many scientific and structural engineering applications. Sparse computations like SpMV require the use of special sparse data structures that efficiently store and access non-zeros. However, sparse data structures can …

    colostate Repository record for A model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality (opens in a new tab)

  2. Identification of regular patterns within sparse data structures

    Sparse matrix-vector multiplication (SpMV) is an essential computation in linear algebra. There is a well-known trade-off between operating on a dense or a sparse structure when performing SpMV. In the dense version of SpMV, useless operations are performed but the computation is amenable SIMD …

    colostate Repository record for Identification of regular patterns within sparse data structures (opens in a new tab)

  3. Parallel simulation methods for large-scale agent-based predator-prey systems : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science at Massey University, Albany, New Zealand

    … straightforward. Parallel update strategies and data structures for multi-core CPU and graphical processing units (GPUs) are developed to simulate a typical predator-prey Animat model with improved performance while reproducing the behaviour of the original model. An analysis is presented of the …

    massey Repository record for Parallel simulation methods for large-scale agent-based predator-prey systems : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science at Massey University, Albany, New Zealand (opens in a new tab)

  4. On the underpinnings of human RNA splicing: a critical survey

    … total RNA and polyA capture sequencing data set of 300 human cell types and tissue samples. We uncover global differences between the landscapes of alternative splicing and expression, finding that alternative splicing can often be a better indicator of cell identity. We show that the …

    unsw Repository record for On the underpinnings of human RNA splicing: a critical survey (opens in a new tab)

  5. An improved implementation of sparsity detection of sparse derivative matrices

    … improvement. Manual determination of sparsity structure of Jacobian matrix for a large problem is complicated and highly error-prone. The main motivation of this research is to propose an efficient algorithm which can effectively detect and represent sparsity of unknown Jacobian matrices. …

    lethbridge Repository record for An improved implementation of sparsity detection of sparse derivative matrices (opens in a new tab)

  6. A Computational study of sparse or structured matrix operations

    … matrix operations, where the matrices are dense, sparse, or structured in Java. We implement a subset of BLAS operations in Java and compare their performance with standard data structures Compressed Row Storage (CRS) and Java Sparse Array (JSA) for dense and sparse structured matrices. The …

    lethbridge Repository record for A Computational study of sparse or structured matrix operations (opens in a new tab)