Storage reorganization techniques for matrix computation in a paging environment

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Storage reorganization techniques for matrix computation in a paging environment

Full text

Pdf (900 KB)

Source

Communications of the ACM archive
Volume 22 , Issue 7 (July 1979) table of contents

Pages: 405 - 415

Year of Publication: 1979

ISSN:0001-0782

Authors

Patrick C. Fischer	The Pennsylvania State Univ., University Park
Robert L. Probert	Univ. of Saskatchewan, Saskatoon, Saskatchewan, Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 24, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/359131.359134 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Condry, M.W. On arbitrary array pagination strategies: Storage and reorganization. Unpublished report.
	2	Elshoff, J.L. Some programming techniques for processing multidimensional matrices in a paging environment. Res. Pub. GMR- 1483, General Motors Res. Lab., Warren, Michigan, Oct. 1973.
	3	Patrick C. Fischer, Further Schemes for Combining Matrix Algorithms, Proceedings of the 2nd Colloquium on Automata, Languages and Programming, p.428-436, July 29-August 02, 1974
	4	Patrick C. Fischer , Robert L. Probert, Efficient Procedures for Using Matrix Algorithms, Proceedings of the 2nd Colloquium on Automata, Languages and Programming, p.413-427, July 29-August 02, 1974
	5	Patrick C. Fischer , Robert L. Probert, A note on matrix multiplication in a paging environment, Proceedings of the annual conference, p.17-21, October 20-22, 1976, Houston, Texas, United States [doi>10.1145/800191.805516]
	6	Floyd, R.W. Permuting information in idealized two-level storage. In Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds., Plenum Press, New York-London, 1972, pp. 105-109.
	7	A. C. McKellar , E. G. Coffman, Jr., Organizing matrices and matrix operations for paged memory systems, Communications of the ACM, v.12 n.3, p.153-165, March 1969 [doi>10.1145/362875.362879]
	8	Cleve B. Moler, Matrix computations with Fortran and paging, Communications of the ACM, v.15 n.4, p.268-270, April 1972 [doi>10.1145/361284.361297]
	9	Probert, R.L. On the additive complexity of matrix multiplication. SlAM J. Comptng. 5, 2 (June 1976), 187-203.
	10	Probert, R.L. On the composition of matrix multiplication algorithms. Proc. Sixth Manitoba Conf. Numerical Mathematics and Computing, 1976, pp. 357-366.
	11	Alan C. Shaw, The Logical Design of Operating Systems, Prentice Hall PTR, Upper Saddle River, NJ, 1974
	12	Strassen, V. Gaussian elimination is not optimal. Numerische Mathematik 13 (1969), 354-356.

CITED BY 8

	Alok Aggarwal , Ashok Chandra, Virtual memory algorithms, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.173-185, May 02-04, 1988, Chicago, Illinois, United States
	Jeremy D. Frens , David S. Wise, Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code, ACM SIGPLAN Notices, v.32 n.7, p.206-216, July 1997
	Bowen Liu , Nelson Strother, Programming in VS Fortran on the IBM 3090 for Maximum Vector Performance, Computer, v.21 n.6, p.65-76, June 1988
	David S. Wise , Jeremy D. Frens , Yuhong Gu , Gregory A. Alexander, Language support for Morton-order matrices, ACM SIGPLAN Notices, v.36 n.7, p.24-33, July 2001
	Michael W. Condry, Paging as a "language processing" task, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.63-76, January 26-28, 1981, Williamsburg, Virginia
	C.-F. Yu , B. W. Wah, Efficient Branch-and-Bound Algorithms on a Two-Level Memory System, IEEE Transactions on Software Engineering, v.14 n.9, p.1342-1356, September 1988
	A. Park , K. Balasubramanian , R. J. Lipton, Array Access Bounds for Block Storage Memory Systems, IEEE Transactions on Computers, v.38 n.6, p.909-913, June 1989
	Michael D. Adams , David S. Wise, Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms, Proceedings of the 2006 workshop on Memory system performance and correctness, October 22-22, 2006, San Jose, California

INDEX TERMS

Keywords:
data reorganization, matrix multiplication, pagination, paging, transpose, virtual memory

Collaborative Colleagues:

Patrick C. Fischer: colleagues

Robert L. Probert: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player