Organizing matrices and matrix operations for paged memory systems
From MaRDI portal
Publication:5563772
DOI10.1145/362875.362879zbMath0175.16405OpenAlexW2004711550MaRDI QIDQ5563772
Archie C. McKellar, Edward G. jun. Coffman
Publication date: 1969
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/362875.362879
Related Items (11)
The uniform memory hierarchy model of computation ⋮ The input/output complexity of transitive closure ⋮ Zur Verbesserung der Lokalität im Zugriff auf Felder ⋮ QR-factorization of partitioned matrices. Solution of large systems of linear equations with non-definite coefficient matrices ⋮ Solving large dense systems of linear equations on systems with virtual memory and with cache ⋮ Operating with potentials of discrete variables ⋮ On the paging-complexity of periodic arrangements ⋮ A blocked all-pairs shortest-paths algorithm ⋮ Hypermatrix solution of larg e sets of symmetric positive-definite linear equations ⋮ Hypermatrix generalization of the Jacobi- and Eberlein-method for computing eigenvalues and eigenvectors of Hermitian or non-Hermitian matrices ⋮ Storing matrices on disk for efficient row and column retrieval
This page was built for publication: Organizing matrices and matrix operations for paged memory systems
