Patrick C. Fischer
- 1 Condry, M.W. On arbitrary array pagination strategies: Storage and reorganization. Unpublished report.Google Scholar
- 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.Google Scholar
- 3 Fischer, P.C. Further schemes for combining matrix algorithms. In Automata, Languages, and Programming, 2nd colloquium, J. Loeckx, Ed., Springer-Verlag, Berlin, 1974, pp. 428-436. Google Scholar
- 4 Fischer, P.C., and Probert, R.L. Efficient procedures for using matrix algorithms. In Automata, Languages, and Programming, 2nd colloquium, J. Loeckx, Ed., Springer-Verlag, Berlin, pp. 413--427. Google Scholar
- 5 Fischer, P.C., and Probert, R.L. A note on matrix multiplication in a paging environment. Proc. ACM Nat. Conf., 1976, Houston, Texas, pp. 17-21. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 7 McKeUar, A.C., and Coffman, E.G., Jr. Organizing matrices and matrix operations for paged memory systems. Comm. A CM 12, 3 (March 1969), 153-165. Google ScholarDigital Library
- 8 Moler, C.B. Matrix computations with Fortran and paging. Comm. ACM 15, 4 (April 1972), 268-270. Google ScholarDigital Library
- 9 Probert, R.L. On the additive complexity of matrix multiplication. SlAM J. Comptng. 5, 2 (June 1976), 187-203.Google ScholarCross Ref
- 10 Probert, R.L. On the composition of matrix multiplication algorithms. Proc. Sixth Manitoba Conf. Numerical Mathematics and Computing, 1976, pp. 357-366.Google Scholar
- 11 Shaw, R.L. The Logical Design of Operating Systems. Prentice- Hall, Englewood Cliffs, N.J., 1974. Google ScholarDigital Library
- 12 Strassen, V. Gaussian elimination is not optimal. Numerische Mathematik 13 (1969), 354-356.Google ScholarDigital Library
Recommendations
Speculative paging for future NVM storage
MEMSYS '17: Proceedings of the International Symposium on Memory SystemsThe quest for greater performance and efficiency has driven modern cloud applications towards "in-memory" implementations, such as memcached and Apache Spark. Looking forward, however, the costs of DRAM, due to its low area density and high energy ...
Dynamic scratchpad memory management for code in portable systems with an MMU
In this work, we present a dynamic memory allocation technique for a novel, horizontally partitioned memory subsystem targeting contemporary embedded processors with a memory management unit (MMU). We propose to replace the on-chip instruction cache ...
A simple linear model of demand paging performance
Predicting the performance of a proposed automatically managed multilevel memory system requires a model of the patterns by which programs refer to the information stored in the memory. Some recent experimental measurements on the Multics virtual memory ...
Comments