1 / 25

Reminder: Array Representation In C++

Learn about the array-of-arrays and sparse matrix representations in C++, including row-major mapping and various data structures.

rdailey
Download Presentation

Reminder: Array Representation In C++

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. x[] a b c d e f g h i j k l Reminder: Array Representation In C++ • This representation is called the array-of-arrays representation. • Requires contiguous memory of size 3, 4, 4, and 4 for the 4 1D arrays. • 1 memory block of size number of rows and number of rows blocks of size number of columns

  2. row 0 row 1 row 2 … row i Reminder: Row-Major Mapping Example 3 x 4 array: a b c d e f g h i j k l Convert into 1D array y by collecting elements by rows. Within a row elements are collected from left to right. Rows are collected from top to bottom. We get y[] ={a, b, c, d, e, f, g, h, i, j, k, l}

  3. Row-Major • Used in Google’s TensorFlow • From code comments on GitHub: "For all types other than TF_STRING, the data buffer stores elements in row major order. “

  4. Sparse Matrices sparse … many elements are zero dense … few elements are zero

  5. Example Of Sparse Matrices diagonal tridiagonal lower triangular (?) These are structured sparse matrices. May be mapped into a 1D array so that a mapping function can be used to locate an element.

  6. Unstructured Sparse Matrices Airline flight matrix. airports are numbered 1 through n flight(i,j)= list of nonstop flights from airport i to airport j n = 1000 (say) n x n array of list references => 4 million bytes total number of flights = 20,000 (say) need at most 20,000 list references => at most 80,000 bytes

  7. Unstructured Sparse Matrices Web page matrix. web pages are numbered 1 through n web(i,j)= number of links from page i to page j Web analysis. authority page … page that has many links to it hub page … links to many authority pages

  8. Web Page Matrix n = 2 billion (and growing by 1 million a day) n x n array of ints => 4* 1018 integers = 16* 1018 bytes (16 * 109 GB) each page links to 10 (say) other pages on average on average there are 10 nonzero entries per row space needed for nonzero elements is approximately 20 billion x 4 bytes = 80 billion bytes (80 GB)

  9. A Sparse Matrix • An example of a sparse matrix: (2 nonzero elements, 10 zero elements) [[1, 0, 0, 0] [0, 0, 2, 0] [0, 0, 0, 0]]

  10. Representation Of Unstructured Sparse Matrices Single linear list in row-major order. scan the nonzero elements of the sparse matrix in row-major order each nonzero element is represented by a triple (row, column, value) the list of triples may be an array list or a linked list (chain)

  11. list = row 1 1 2 2 4 4 column 3 5 3 4 2 3 value 3 4 5 7 2 6 Single Linear List Example 0 0 3 0 4 0 0 5 7 0 0 0 0 0 0 0 2 6 0 0

  12. element 0 1 2 3 4 5 row 1 1 2 2 4 4 column 3 5 3 4 2 3 value 3 4 5 7 2 6 Array Linear List Representation row 1 1 2 2 4 4 list = column 3 5 3 4 2 3 value 3 4 5 7 2 6

  13. row col value next Chain Representation Node structure.

  14. 1 3 1 5 2 3 2 4 4 2 4 3 3 4 5 7 2 6 NULL firstNode Single Chain row 1 1 2 2 4 4 list = column 3 5 3 4 2 3 value 3 4 5 7 2 6

  15. One Linear List Per Row row1 = [(3, 3), (5,4)] row2 = [(3,5), (4,7)] row3 = [] row4 = [(2,2), (3,6)] 0 0 3 0 4 0 0 5 7 0 0 0 0 0 0 0 2 6 0 0

  16. next col value Array Of Row Chains Node structure.

  17. NULL 3 3 5 4 NULL 3 5 4 7 NULL 2 2 3 6 row[] Array Of Row Chains 0 0 3 0 4 0 0 5 7 0 0 0 0 0 0 0 2 6 0 0 NULL

  18. row col value down next Orthogonal List Representation Both row and column lists. Node structure.

  19. 1 3 1 5 3 4 N 2 3 2 4 5 7 N NULL 4 2 4 3 2 6 N Row Lists 0 0 3 0 4 0 0 5 7 0 0 0 0 0 0 0 2 6 0 0

  20. 1 3 1 5 3 4 N 2 3 2 4 5 7 4 2 4 3 2 6 N N Column Lists 0 0 3 0 4 0 0 5 7 0 0 0 0 0 0 0 2 6 0 0

  21. 1 3 1 5 3 4 N N 2 3 2 4 5 7 N NULL 4 2 4 3 2 6 N N N row[] Orthogonal Lists 0 0 3 0 4 0 0 5 7 0 0 0 0 0 0 0 2 6 0 0

  22. Variations May use circular lists instead of chains.

  23. Approximate Memory Requirements 500 x 500 matrix with 1994 nonzero elements 2D array 500 x 500 x 4 = 1million bytes Single Array List 3 x 1994 x 4 = 23,928 bytes One Chain Per Row 23928 + 500 x 4 = 25,928

  24. Runtime Performance Matrix Transpose 500 x 500 matrix with 1994 nonzero elements 2D array 1.97 ms Single Array List 0.09 ms One Chain Per Row 1.57 ms

  25. Performance Matrix Addition. 500 x 500 matrices with 1994 and 999 nonzero elements 2D array 2.69 ms Single Array List 0.13 ms One Chain Per Row Not Measured

More Related