Description: 1, designed to
1, dynamic partitioning storage management to understand the working principle of
2, master partition of about three algorithms: First-fit algorithm, the best-fit algorithm and the worst-fit algorithm
3, grasp the dynamic partition of storage allocation and storage process of recovery
Second, the design requirements
1, the establishment of free partition table data file, the file includes two fields: the starting address of free zones and the length the file has a number of records, that the current system has more than idle partitions
2, the establishment has been assigned the partition table data file, which includes three fields: the starting address of the allocated area, length, operating name The document has a number of records, that the current system has multiple operations
3, the program starts reading from a two partition table data file, and displayed on the screen using the state of the memory
3, accept the user s memory, applications, fo
File list (Check if you may need any files):
OS_Big_Work_No3\Allocated_Info.h
...............\Alloc_Info_Sort.h
...............\Best_Fit_Algo_Sort.h
...............\Debug\main.o
...............\.....\Memory_Routine.o
...............\.....\Memory_Routine_By_BFA.o
...............\.....\Memory_Routine_By_FFA.o
...............\.....\Memory_Routine_By_WFA.o
...............\.....\test.exe
...............\First_Fit_Algo_Sort.h
...............\Free_Info.h
...............\main.c
...............\main.cpp
...............\Memory_Routine.c
...............\Memory_Routine.cpp
...............\Memory_Routine.h
...............\Memory_Routine_By_BFA.cpp
...............\Memory_Routine_By_BFA.h
...............\Memory_Routine_By_BFA.html
...............\Memory_Routine_By_FFA.cpp
...............\Memory_Routine_By_FFA.h
...............\Memory_Routine_By_WFA.cpp
...............\Memory_Routine_By_WFA.h
...............\test.msp
...............\Worst_Fit_Algo_Sort.h
...............\Debug
OS_Big_Work_No3
Download