CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Internal and External Fragmentation

A 1000 Kbyte ...

Question

A 1000 Kbyte memory is managed using variable partitions but no compaction. It currently has two partitions of sizes 200 Kbytes and 260 Kbytes respectively. The smallest allocation request in Kbytes that could be denied is for

Open in App

Solution

Initially memory available:

1000 K Byte

After allocation 200 K byte and 260 K byte in worst case.

1000 K Byte

180 200 KB 180 260 KB 180

So, in worst case partition left with size 180 KB that are not contiguous. So, request for allocation request 181 will be denied because it is asking smallest request.

Suggest Corrections

thumbs-up

1

Similar questions

Q. Memory size is 1000 KB. Variable prutitioning is used for memory allocation to processes. Currently there are 2 partitions of size 200 KB & 250 KB & 2 free holes. The smallest request that could be denied is _____ KB. (Rounded off with no decimal points)

Q. Consider the following C declaration:

struct
{
short s[5];
union
{
float y;
long z;
} u;
} t;

Assume that objects of the short, float and long occupy 2 bytes, 4 bytes and 8 bytes respectively. The memory requirement for variable t, ignoring alignment consideration is

Q. In a computer system, four files of size 11050 bytes. 4990 bytes, 5170 bytes and 12640 bytes need to be stored. For storing these files on disk, we can use either 100 byte disk blocks or 200 byte disk blocks (but can't mix block sizes). For each block used to store a file, 4 bytes of bookkeepiing information also needs to be stored on the disk. Thus, the total space used to store a file is the sum of the space taken to store the file and the space taken to store the book keeping information for the blocks allocated for storing the file. A disk block can store either bookkeeping information for a file or data from a file, but not both.

What is the total space required for storing the files using 100 byte disk blocks and 200 byte disk blocks respectively?

Q. Consider a machine with a byte addressable main memory of

2^{20}

bytes, block size of 16 bytes and a direct mapped cache having

2^{12}

cache lines. Let the addresses of two consecutive bytes in main memory be

(E 201 F)_{16}

(E 2020)_{16}

. What are the tag cache line address (in hex) for main memory address

(E 201 F)_{16}

Q. If a cache has 64-bytes cache lines, how long does it takes to fetch a cache line if the main memory takes 20 cycles to respond to each memory request and returns 2 bytes of data in response to each request ?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Internal and External Fragmentation

OTHER

Watch in App

explore_more_icon

Explore more

Internal and External Fragmentation

Join BYJU'S Learning Program

CrossIcon