• Title/Summary/Keyword: Sparse Matrix Storage Format

Search Result 2, Processing Time 0.015 seconds

Two dimensional variable-length vector storage format for efficient storage of sparse matrix in the finite element method (유한요소법에서 희소행렬의 효율적인 저장을 위한 2차원 가변길이 벡터 저장구조)

  • Boo, Hee-Hyung;Kim, Sung-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.9
    • /
    • pp.9-16
    • /
    • 2012
  • In this paper, we propose the two dimensional variable-length vector storage format which can be used for efficient storage of sparse matrix in the FEM (finite element method). The proposed storage format is the method storing only actual needed non-zero values of each row on upper triangular matrix with the total rows N, by using two dimensional variable-length vector instead of $N{\times}N$ large sparse matrix of entire equation of finite elements. This method only needs storage spaces of the number of minimum 1 to maximum 5 in 2D grid structure and the number of minimum 1 to maximum 14 in 3D grid structure of analysis target. The number doesn't excess two times although involving index number. From the experimental result, we can find out that the proposed storage format can reduce the memory space more effectively, as the total number of nodes increases, than the existing skyline storage format storing maximum column height.

Compressing Method of NetCDF Files Based on Sparse Matrix (희소행렬 기반 NetCDF 파일의 압축 방법)

  • Choi, Gyuyeun;Heo, Daeyoung;Hwang, Suntae
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.11
    • /
    • pp.610-614
    • /
    • 2014
  • Like many types of scientific data, results from simulations of volcanic ash diffusion are of a clustered sparse matrix in the netCDF format. Since these data sets are large in size, they generate high storage and transmission costs. In this paper, we suggest a new method that reduces the size of the data of volcanic ash diffusion simulations by converting the multi-dimensional index to a single dimension and keeping only the starting point and length of the consecutive zeros. This method presents performance that is almost as good as that of ZIP format compression, but does not destroy the netCDF structure. The suggested method is expected to allow for storage space to be efficiently used by reducing both the data size and the network transmission time.