High-performance memory management method and system based on differential evolution

Abstract

The invention provides a high-performance memory management method and system based on differential evolution. The method comprises the steps that in a disk, a table for recording memory page information is created, and the table comprises a start memory page number, an end memory page number, an access frequency, a check frequency and a differential evolution calculation result. If the current execution stream is the timed active execution stream, checking the use condition of the memory page once according to a fixed time interval; if the current execution stream is a passive execution stream, when the currently executed program accesses the memory again, the execution stream is passively executed, and the accessed content is recorded; and if the current execution stream is a dynamic execution stream, executing as required when a new program needs to enter the memory, and dynamically adjusting the use of the memory. According to the method and the device, the waiting time and the waiting probability caused by memory calling during program execution are greatly reduced, the space complexity is reduced, the generation of a Belady phenomenon can be well reduced, and the time complexity of overall calculation is reduced.

Description

technical field [0001] The present application relates to the technical field of computer memory management, in particular to a high-performance memory management method and system based on differential evolution. Background technique [0002] Because present computer software is more and more huge, there are more and more software systems with the size of T (1T=1024G) bytes at every turn. However, the memory capacity of most computers is still on the order of G bytes (usually 1G-128G). Therefore, the memory management and scheduling of the computer operating system is a very important task of the operating system. [0003] The operating system needs to load program data from disk into memory from time to time. When the memory capacity is full, the memory needs to be cleaned up to release a certain amount of space, which is divided into pages (or a combination of segment pages). After completing the corresponding cleaning, the operating system replaces the required data i...

AI Technical Summary

Problems solved by technology

[0010] 2. The above management strategies cannot well balance the problem of page fault rate. Even if the size of a single page is reduced to obtain more pages, the Belady phenomenon will still occur (replacement characteristics contradict the dynamic characteristics of process access memory , resulting in non-stop memory replacement);

[0012] 4. A large amount of computing overhead may be generated when calculating the usage of the page. It is necessary to scan the entire maintained page information, and compare and find the maximum or minimum value from it.

Images