Description: Design program to simulate the dynamic partitioning method of memory storage management. Free area of memory using free-chain management, using the worst-fit algorithm to find the chain from the free distribution of free area. Assuming a total system memory 640K, the initial state for the operating system itself takes 64K. t1 time, there are jobs A, B, C, D, respectively, request 8K, 16K, 64K, 124K of memory space t2 time, the job completed C t3 time, the operation E requests 50K of memory space t4 time, D operation complete. Requirements were programmed output t1, t2, t3, t4 time of memory free zone status.
To Search:
File list (Check if you may need any files):
OSexperience7.cpp
Download