Analysis of Graphs by Connectivity Considerations
Journal of the ACM (JACM)
Analysis of boolean program models for time-shared, paged environments
Communications of the ACM
ACM '66 Proceedings of the 1966 21st national conference
System design of a computer for time sharing applications
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
Structure of the multics supervisor
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
A general-purpose file system for secondary storage
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
Dynamic Characteristics of Loops
IEEE Transactions on Computers
Analysis of an Information System Model with Transfer Penalties
IEEE Transactions on Computers
Segmentation and optimization of programs from cyclic structure analysis
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Virtual storage and virtual machine concepts
IBM Systems Journal
Program restructuring for virtual memory
IBM Systems Journal
| Hi-index | 0.01 |
The past few years have seen a significant increase in the number of computers with segmented memories, i.e., computers in which executable memory is divided into a fixed number of fixed length segments. A computer so organized can offer significant advantages over the more conventionally organized machine, the foremost advantage being that such an organization facilitates running a job with only a portion of that job in executable memory. This can be done in other computers but the determination of what portions of the program must be in executable memory at any given point in the process is then the responsibility of the person writing the program, i.e., the programmer must schedule the overlaying himself and reflect this schedule in the program.