KUET Institutional Repository

An Efficient Representation of Higher Dimensional Arrays and its Evaluation

Show simple item record

dc.contributor.advisor Hasan, Prof. Dr. K. M. Azharul
dc.contributor.author Shaikh, Md. Abu Hanif
dc.date.accessioned 2018-08-29T06:53:15Z
dc.date.available 2018-08-29T06:53:15Z
dc.date.copyright 2016
dc.date.issued 2016-07
dc.identifier.other ID 1107555
dc.identifier.uri http://hdl.handle.net/20.500.12228/427
dc.description This thesis is submitted to the Department of Computer Science and Engineering, Khulna University of Engineering & Technology in partial fulfillment of the requirements for the degree of Master of Science in Computer Science and Engineering, July 2016. en_US
dc.description Cataloged from PDF Version of Thesis.
dc.description Includes bibliographical references (pages 60-63).
dc.description.abstract Scientilic and engineering computing requires storing and operating on flooded amount of data having very high number of dimensions. Traditional multidimensional array is widely popular for implementing higher dimensional data but its performance diminishes with increased number of dimensions. On the other side, traditional row-column view of two-dimensional data is facile for implementation, imagination and visualization. This thesis represents a scheme for higher dimensional array implementation and operation with row-column abstraction which can fit an n-dimensional array into a single 2-dimensional array. A mathematical function fits odd dimensions along row-direction and even dimensions along column direction which gives lower index computation cost, higher data locality and better sequential access of memory. Performance of the proposed matricization is measured with matrix-matrix addition/subtraction and multiplication operation which give 70% and 72% improvement respectively for dense data. But most real world data is sparse and degree of data sparsity increases with increased number of dimensions. A loop transformation technique which access odd dimensions fast and then even dimensions is proposed to store any dimensional sparse arrays. In traditional scheme, n numbers of one-dimensional auxiliary arrays are necessary to store n-dimensional array but our scheme requires two one-dimensional auxiliary arrays only which gives 16 times space improvement for 32-dimensional sparse data. Traditionally, the compression ratio is inversely proportional to the number of dimensions but it is independent of number of dimensions in our scheme. The operation on stored sparse data is measured with matrix-matrix addition/subtraction and multiplication which show up to 70% improvement. en_US
dc.description.statementofresponsibility Md. Abu Hanif Shaikh
dc.format.extent 63 pages
dc.language.iso en_US en_US
dc.publisher Khulna University of Engineering & Technology (KUET), Khulna, Bangladesh. en_US
dc.rights Khulna University of Engineering & Technology (KUET) thesis/ dissertation/internship reports are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission.
dc.subject Higher Dimensional Arrays en_US
dc.subject Array en_US
dc.title An Efficient Representation of Higher Dimensional Arrays and its Evaluation en_US
dc.type Thesis en_US
dc.description.degree Master of Science in Computer Science and Engineering
dc.contributor.department Department of Computer Science and Engineering


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search KUET IR


Advanced Search

Browse

My Account

Statistics