Swapping systems eliminate holes by compaction


Swapping systems eliminate holes by compaction. Assuming a random distribution of many holes and many data segments, and the time to read or write a 32-bit memory word of 3nsec, about how long would it take to compact 8GB? For simplicity, assume that word 0 is part of a hole and that the highest word in memory contains valid data. What about if you upgrade to memory that can be read or written to in 1nsec? Comment briefly on the effects of compaction on normal processing.

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Swapping systems eliminate holes by compaction
Reference No:- TGS0133780

Expected delivery within 24 Hours