Principles of Optimal Page Replacement
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Storage reorganization techniques for matrix computation in a paging environment
Communications of the ACM
Matrix computations with Fortran and paging
Communications of the ACM
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM
Structure of a LISP system using two-level storage
Communications of the ACM
Compilation and delayed evaluation in APL
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Tentative compilation: A design for an APL compiler
APL '79 Proceedings of the international conference on APL: part 1
An apl machine
Optimal paging-strategies and stability considerations for solving large linear-systems.
Optimal paging-strategies and stability considerations for solving large linear-systems.
| Hi-index | 0.00 |
This paper examines "language processing" approach to paging where the of the programming language compiler or interpreter is responsible for generating the necessary control code for the page management of a program. We explore this idea for APL and describe an approach to incorporating in a program the necessary paging functions. The semantics of APL computation are examined to observe how paging operations can be incorporated into the computation. We discuss a model of data access in APL that exhibits storage use for both scalar and page references. A data structure that encodes the logical use of data from an array is introduced. We find that ordering computations efficiently and computing paging needs can be determined by simple transformations on this structure. This analysis leads us to an efficient method for paging an APL computation. Our approach builds on previous studies for efficiently executing APL.