Thumbnail
Access Restriction
Subscribed

Author McKellar, A. C. ♦ Coffman, E. G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Array storage allocation ♦ Paged memory systems ♦ Paging algorithms ♦ Array processing ♦ Virtual memory systems ♦ Storage allocation ♦ Matrix algorithms
Abstract Matrix representations and operations are examined for the purpose of minimizing the page faulting occurring in a paged memory system. It is shown that carefully designed matrix algorithms can lead to enormous savings in the number of page faults occurring when only a small part of the total matrix can be in main memory at one time. Examination of addition, multiplication, and inversion algorithms shows that a partitioned matrix representation (i.e. one submatrix or partition per page) in most cases induced fewer page faults than a row-by-row representation. The number of page-pulls required by these matrix manipulation algorithms is also studied as a function of the number of pages of main memory available to the algorithm.
Description Affiliation: Princeton Univ., Princeton, NJ (McKellar, A. C.) || Princeton Univ., NJ (Coffman, E. G.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 12
Issue Number 3
Page Count 13
Starting Page 153
Ending Page 165


Open content in new tab

   Open content in new tab
Source: ACM Digital Library