This course is run at the The University of Nottingham within the School of Computer Science & IT. The course is run by Graham Kendall (EMAIL : gxk@cs.nott.ac.uk)
|
Twelve bits can represent 4096 (i.e. 212 = 4096). This is the size (in bytes) of our page table. Therefore, these twelve bits of the address (whether incoming or outgoing) represent the offset within the page. In the example we looked at the top four bits of the virtual address represent the virtual page and the top three bits of the physical address represent the physical page. But, in both cases, the bottom twelve bits represent the offset within the page. Therefore, the offset address can simply be copied.
Segmentation .. (Tanenbaum, 1992), pages 128 - 141.
· Denning, P.J. 1968. The Working Set Model for Program Behaviour. Communications of the ACM, Vol. 11, pp 323-333.
· Denning, P.J. 1968a. Working Sets Past and Present. IEEE Trans on Software Engineering, Vol. SE-6, pp 64-84.
· Denning, P.J. 1968b. Thrashing: Its Causes and Prevention. Proceedings AFIPS National Computer Conference, pp 915-922.
· Denning, P.J. 1970. Virtual Memory. Computing Surveys, Vol. 2, pp 153-189.
· Fortheringham, J. 1961. Dynamic Storage Allocation in the Atlas Computer Including an Automatic Use of a Backing Store. Communications of the ACM, Vol. 4, pp 435-436
· Kaufman, A. 1984. Tailored-List and Recombination-Delaying Buddy Systems. ACM Trans. On Programming Languages and Systems, Vol. 6, pp 118-125
· Knowlton, K.C. 1965. A Fast Storage Allocator. Communications of the ACM, vol 8, pp 623-625.
· Knuth, D.E. 1973. The Art of Computer Programming, Volume 1 : Fundamental Algorithms, 2nd ed, Reading, MA, Addison-Wesley
· Peterson, J.L., Norman, T.A. 1977. Buddy Systems. Communications of the ACM, Vol. 20, pp 421-431
· Smith, A.J. 1978. Bibliography on Paging and Related Topics. Operating Systems Review, Vol. 12, pp 39-56
· Tanenbaum, A., S. 1992. Modern Operating Systems. Prentice Hall.
| Last Page | Back to Main Index | Next Page |
Last Updated : 23/01/2002