Author(s)

M.P. Bekakos & O.B. Efremides

Abstract

This paper investigates an efficient parallel technique for reducing sparse matrices that can be applied to analysis tables. This kind of matrices take up a great amount of memory space by the zero entries and, hence, a subtle compaction scheme is necessary. The benefit of the parallel approach intro- duced herein is that a very compact form results which will contribute to a greatly reduced time when accessing the given data structure. 1 Introduction Some sequential techniques have been proposed in Knuth[3] and Aho[l] only for the nonzero entries to be represented as list data structures. However, although these methods are quite suited to insert a new entry and delete a redundant one in the matrix, they are not always effective because of the considerable amount of ti

Keywords