Discuss how memory fragmentation occurs in each of the memory organization schemes presented in this chapter.
What will be an ideal response?
Contiguous allocation: The chunk does not fill the available memory hole. Noncontiguous
allocation: The several chunks do not fill the available holes. Fixed partition multiprogramming
with absolute translation and loading:A job does not fill its designated partition; a
partition is empty and has no jobs waiting for it, while jobs that would fit in that partition
have been designated for busy partitions. Fixed-partition multiprogramming with relocatable
translation and loading:A job does not fill the partition it occupies; a small job in one partition
could also fit in another open partition—a second job arrives too large for the open partition
but it could fit in the occupied partition—the arriving job must wait (of course, physical
memory management systems could be designed to move already loaded jobs around, but
this has not been the case). Variable-partition multiprogramming:After contiguously loading
jobs, there will normally be one memory hole remaining; as contiguously loaded jobs randomly
terminate, holes will be dispersed throughout memory. Multiprogramming with memory
swapping:The job currently swapped in does not fill available memory.
You might also like to view...
The symbols * and & are examples of wildcards
Indicate whether the statement is true or false
The open systems interconnection (OSI) model is inefficient; each layer must take the work of higher layers, add some result, and pass the work to lower layers. This process ends with the equivalent of a gift inside seven nested boxes, each one wrapped and sealed. Surely this wrapping (and unwrapping) is inefficient. From reading earlier chapters of this book, cite a security advantage of the layered approach.
Fill in the blank(s) with the appropriate word(s).