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

  1. 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)

  2. Provably Asymptotically Near-Optimal Motion Planning with Sparse Data Structures

    … near-optimal solutions produce sparser graphs by notincluding all edges. The idea stems from graph spanner algorithms,which produce sparse subgraphs that guarantee near-optimal paths.Existing asymptotically optimal and near-optimal planners, however,include all sampled …

    unr Repository record for Provably Asymptotically Near-Optimal Motion Planning with Sparse Data Structures (opens in a new tab)

  3. Design of efficient block-sparse data structures and associated tensor multiplications for applications in Cluster in Molecule electronic structure calculations

    … with this problem, we have implemented two block-sparse data structures named the Tile and the Tile Master to provide sparse matrix storage formats and efficient matrix multiplication algorithms benefiting from the high sparsity of the data. The Tile structure focuses on the efficiency of …

    waterloo Repository record for Design of efficient block-sparse data structures and associated tensor multiplications for applications in Cluster in Molecule electronic structure calculations (opens in a new tab)

  4. 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)

  5. On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures

    … large-scale problems often the Hessian matrix is sparse and structured, and it is preferable to exploit such information when available. Using symmetry in the second derivative values of the components it is possible to detect the sparsity pattern of the Hessian via products of the Hessian matrix …

    lethbridge Repository record for On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures (opens in a new tab)

  6. Dynamic robust sparse modeling and sampling of high-dimensional data streams for online monitoring and change detection

    … (CDS). It leverages spatial dependencies within data streams to improve decision making, when deploying sensors with resource limitations. Furthermore, we develop a dimension reduction method named “Robust Sparse Principal Component Analysis” (RS-PCA), that is designed to robustly estimate a …

    gatech Repository record for Dynamic robust sparse modeling and sampling of high-dimensional data streams for online monitoring and change detection (opens in a new tab)

  7. A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE

    … problems. To speed up computation, we utilized sparse data structures and other heuristics to better handle large datasets. Our experimental results demonstrate that sGS-ADMM provides improved efficiency for large datasets. Under additional constraints, sGS-ADMM is also able to attain better …

    nus Repository record for A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE (opens in a new tab) Download file for A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE (opens in a new tab)

  8. Improved implementation of some coloring algorithms for the determination of large and sparse Jacobian matrices

    … linear system. Many real-life problems are sparse and if we know the sparsity structure of the Jacobian in advance, great computational saving can be achieved. We revisit heuristic algorithms and sparse data structures used to determine sparse Jacobian matrices. We provide a new …

    lethbridge Repository record for Improved implementation of some coloring algorithms for the determination of large and sparse Jacobian matrices (opens in a new tab)

  9. Advanced semantics for accelerated graph processing

    … such as counter-intelligence, proteomics, and data mining. Unfortunately, graph-based problems exhibit certain basic characteristics that make them a poor match for conventional computing systems in terms of structure, scale, and semantics. Graph processing kernels emphasize sparse data …

    lsu-thes Repository record for Advanced semantics for accelerated graph processing (opens in a new tab)

  10. Optimizing Irregular Computations on Parallel Processors

    … challenging on parallel processors due to their data-dependent memory accesses, e.g. the indirect memory accesses (e.g., A[B[i]]) in sparse computations. Additionally, control flow dependencies that arise in irregular computations poses limitations to parallelization. Therefore, while currently …

    toronto-retro Repository record for Optimizing Irregular Computations on Parallel Processors (opens in a new tab)

  11. Sparse Graph Algorithms For Analytics And Prediction Tasks

    … used to model large-scale real-world data in our everyday lives. With the growing sizes of these graphs and their expanding application to various tasks, there has been an increasing interest in creating efficient graph algorithms and processing systems. Historically, researchers and …

    umn Repository record for Sparse Graph Algorithms For Analytics And Prediction Tasks (opens in a new tab)

  12. A three-dimensional, time-accurate, incompressible, Navier-Stokes, finite element CFD algorithm

    … boundary conditions, and (e) investigation of sparse data structures and iterative methods for solving the matrix algebra statements generated by the algorithm. In contrast to the general family of "pressure-relaxation" incompressible CFD algorithms, the CCM does not use the pressure as merely …

    utk-theses Repository record for A three-dimensional, time-accurate, incompressible, Navier-Stokes, finite element CFD algorithm (opens in a new tab)

  13. Program Transformations and Sparse Computations in Performance Portability Libraries

    … similar phenomenon occurs with changes of input data and algorithm choice as well. Often, developers must maintain multiple versions of their application, one tuned for each system it will be used on. Performance portability libraries address this problem by separating the description of a …

    arizona-thes Repository record for Program Transformations and Sparse Computations in Performance Portability Libraries (opens in a new tab)

  14. Runtime support for irregular computation in MPI-based applications

    … network analysis. Due to the irregular and data-dependent communication patterns and sparse data structures involved in those applications, the traditional parallel programming model and runtime need to be carefully designed and implemented in order to accommodate the performance and …

    uiuc Repository record for Runtime support for irregular computation in MPI-based applications (opens in a new tab)

  15. Parallel programming frameworks for irregular and regular programs

    … is to categorize programs based on the main data structures that they use. Parallel programs can be classified into irregular and regular programs. Irregular programs typically involve unstructured and sparse data structures such as graphs, trees, or priority queues, which necessitate …

    texas Repository record for Parallel programming frameworks for irregular and regular programs (opens in a new tab)