CN112181863A - Page recovery method, device, terminal and storage medium - Google Patents
Page recovery method, device, terminal and storage medium Download PDFInfo
- Publication number
- CN112181863A CN112181863A CN202011116674.XA CN202011116674A CN112181863A CN 112181863 A CN112181863 A CN 112181863A CN 202011116674 A CN202011116674 A CN 202011116674A CN 112181863 A CN112181863 A CN 112181863A
- Authority
- CN
- China
- Prior art keywords
- page
- inactive
- linked list
- pages
- memory
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000011084 recovery Methods 0.000 title claims abstract description 93
- 238000000034 method Methods 0.000 title claims abstract description 61
- 230000015654 memory Effects 0.000 claims abstract description 172
- 238000004064 recycling Methods 0.000 claims abstract description 84
- 238000004590 computer program Methods 0.000 claims description 17
- 238000010586 diagram Methods 0.000 description 10
- 238000004891 communication Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 7
- 238000012545 processing Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0253—Garbage collection, i.e. reclamation of unreferenced memory
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Retry When Errors Occur (AREA)
Abstract
The application belongs to the technical field of terminals, and particularly relates to a page recovery method, a page recovery device, a terminal and a storage medium. The page recycling method comprises the following steps: when the memory of the Linux system is detected to be insufficient, page recovery is carried out on the inactive pages contained in the inactive page linked list; when a page which fails to be recovered exists in the current page unit of the inactive page linked list, adding the page which fails to be recovered to a temporary page linked list; and acquiring a next page unit of the current page unit of the inactive page linked list, taking the next page unit as the current page unit, and executing the step of adding the page which fails to be recovered to a temporary page linked list when the page which fails to be recovered exists in the current page unit of the inactive page linked list. By adopting the embodiment of the application, the recovery efficiency of the page can be improved.
Description
Technical Field
The application belongs to the technical field of terminals, and particularly relates to a page recovery method, a page recovery device, a terminal and a storage medium.
Background
With the development of science and technology, an operating system supported by a terminal is rapidly developed, so that the life of a user is more convenient. For example, the rapid development of Linux systems also continues to enrich users' lives. In the Linux system, if data can be stored in a disk, when the memory is insufficient, the Linux system can write the data in the disk, and a page occupied by the data in the memory becomes a free page, which can be provided for the Linux system to continue to use.
Disclosure of Invention
The embodiment of the application provides a page recovery method, a page recovery device, a terminal and a storage medium, which can improve the recovery efficiency of pages. The technical scheme of the embodiment of the application is as follows:
in a first aspect, an embodiment of the present application provides a page recycling method, where the method includes:
when the memory of the Linux system is detected to be insufficient, page recovery is carried out on the inactive pages contained in the inactive page linked list;
when a page which fails to be recovered exists in the current page unit of the inactive page linked list, adding the page which fails to be recovered to a temporary page linked list;
and acquiring a next page unit of the current page unit of the inactive page linked list, taking the next page unit as the current page unit, and executing the step of adding the page which fails to be recovered to a temporary page linked list when the page which fails to be recovered exists in the current page unit of the inactive page linked list.
In a second aspect, an embodiment of the present application provides a page recycling device, where the device includes:
the page recovery unit is used for recovering the pages of the inactive pages contained in the inactive page linked list when detecting that the memory of the Linux system is insufficient;
the page adding unit is used for adding the page with the recovery failure to the temporary page linked list when the page with the recovery failure exists in the current page unit of the inactive page linked list;
and the page unit acquiring unit is used for acquiring a next page unit of the current page unit of the inactive page linked list, taking the next page unit as the current page unit, and executing the step of adding the page which fails to be recovered to the temporary page linked list when the page which fails to be recovered exists in the current page unit of the inactive page linked list.
In a third aspect, an embodiment of the present application provides a terminal, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the method of any one of the above first aspects when executing the computer program.
In a fourth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, and the computer program is used for implementing any one of the methods described above when executed by a processor.
In a fifth aspect, embodiments of the present application provide a computer program product, where the computer program product includes a non-transitory computer-readable storage medium storing a computer program, where the computer program is operable to cause a computer to perform some or all of the steps as described in the first aspect of embodiments of the present application. The computer program product may be a software installation package.
The beneficial effects brought by the technical scheme provided by some embodiments of the application at least comprise:
in one or more embodiments of the present application, when detecting that the memory of the Linux system is insufficient, page recycling may be performed on an inactive page included in an inactive page chain table, and when there is a page that fails to be recycled in a current page unit of the inactive page chain table, the page that fails to be recycled may be added to a temporary page chain table, so that when performing page recycling in a next page unit of the current page unit of the inactive page chain table, the page that fails to be recycled may not be recycled, the page recycling time of the next page unit may be reduced, the page recycling steps may be simplified, the page recycling duration of the inactive page chain table may be reduced, and further, the page recycling efficiency may be improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a diagram illustrating a system architecture of a page reclamation method applied to an embodiment of the present application;
fig. 2 is a schematic flowchart illustrating a page recycling method according to an embodiment of the present application;
fig. 3 is a schematic flowchart illustrating a page recycling method according to an embodiment of the present application;
fig. 4 is a schematic flowchart illustrating a page recycling method according to an embodiment of the present application;
FIG. 5 is a flowchart illustrating a page reclamation method according to an embodiment of the present application;
FIG. 6 is a flowchart illustrating a page reclamation method according to an embodiment of the present application;
FIG. 7 is a flowchart illustrating a page reclamation method according to an embodiment of the present application;
FIG. 8 is a schematic structural diagram of a page recycling device according to an embodiment of the present application;
FIG. 9 is a schematic structural diagram of a page recycling device according to an embodiment of the present application;
FIG. 10 is a schematic structural diagram of a page recycling device according to an embodiment of the present application;
fig. 11 shows a schematic structural diagram of a terminal according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In the description of the present application, it is to be understood that the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. In the description of the present application, it is noted that, unless explicitly stated or limited otherwise, "including" and "having" and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus. The specific meaning of the above terms in the present application can be understood in a specific case by those of ordinary skill in the art. Further, in the description of the present application, "a plurality" means two or more unless otherwise specified. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
Fig. 1 is a system architecture diagram of a page reclamation method applied to an embodiment of the present application. As shown in fig. 1, the Linux system may be provided in a terminal including, but not limited to, a personal computer, a mobile device, and the like. The terminal is provided with a memory corresponding to the Linux system. The disk can be arranged in a virtual memory of the peripheral equipment, and can also be arranged in the same terminal with the Linux system. When the disk is disposed in the peripheral virtual memory 200, the terminal 100 and the virtual memory 200 may be connected through an IO interface, so that the terminal 100 may read a page to be written from the virtual memory 200, where the page to be written includes, but is not limited to, a file page, an anonymous page, and the like.
According to some embodiments, when the memory of the Linux system is insufficient and the Linux system performs page recovery, recoverable pages in the Linux system can be recovered, so that the burden of the Linux system can be reduced, and the operating efficiency of the Linux system is higher. For example, when a frequently accessed but recyclable page exists in the Linux system, the terminal may recycle the page when the memory is insufficient, but the page is frequently accessed, so the page is immediately accessed after being recycled, the terminal needs to read the page from the disk into the memory of the Linux system, and perform a read-write operation on the page again, which may increase the burden of the Linux system, and reduce the operating efficiency of the Linux system. The page recycling linked list is generated at the same time, and the page recycling linked list can add pages which are not visited in the preset time into the page recycling linked list, so that when the terminal carries out page recycling, the pages can be recycled in the page recycling linked list, and the pages which are visited frequently cannot be recycled.
It is easy to understand that, when the memory is not enough, the terminal can retrieve the page that is not visited in the preset duration, but when the input/output IO load of the current terminal is higher, the IO load of the terminal can be increased for the retrieval of the page of the terminal, so that the retrieval speed of the page of the terminal is reduced, and then the problem of lower page retrieval efficiency occurs.
According to some embodiments, the number of the page reclamation linked lists in the terminal is at least one. For example, each Memory control subsystem (Memory control groups, Memcg) in the terminal may correspond to a page reclamation linked list. However, when the terminal performs page recovery in the page recovery linked list, the terminal scans a page unit each time, and when a recoverable page is scanned, the recoverable page is recovered. However, when the page recycling linked list has the unrecoverable page, the terminal scans the unrecoverable page every time when scanning by a page unit, so that the page recycling steps are more, the page recycling speed is lower, and the problem of lower page recycling efficiency occurs. The embodiment of the application provides a page recovery method, which can improve the recovery efficiency of pages.
The present application will be described in detail with reference to specific examples.
In one embodiment, as shown in fig. 2, a page recycling method is proposed, which can be implemented by relying on a computer program and can be run on a terminal based on a Linux system. The computer program may be integrated into the application or may run as a separate tool-like application.
Wherein, the terminal may be an electronic device with a Linux system, which includes but is not limited to: wearable devices, handheld devices, personal computers, tablet computers, in-vehicle devices, smart phones, computing devices or other processing devices connected to a wireless modem, and the like. The terminal devices in different networks may be called different names, for example: user equipment, access terminal, subscriber unit, subscriber station, mobile station, remote terminal, mobile device, user terminal, wireless communication device, user agent or user equipment, cellular telephone, cordless telephone, Personal Digital Assistant (PDA), terminal equipment in a 5G network or future evolution network, and the like.
Specifically, the page recovery method comprises the following steps:
step S101, when detecting that the memory of the Linux system is insufficient, page recycling is carried out on the inactive pages contained in the inactive page linked list.
According to some embodiments, the Linux operating system is a clone system developed based on a UNIX operating system, and the Linux system in the terminal can write a page, that is, the Linux system can read the file from a disk into a memory of the Linux system, modify data in the memory of the Linux system, and write the data into the disk, so as to complete the write operation on a file. The file includes at least one page.
It will be readily appreciated that the inactive page link list includes, but is not limited to, an inactive file page link list and an inactive anonymous page link list, and the like. The inactive page linked list refers to a set of pages that are not accessed within a preset duration. The terminal may set, for example, the PG _ active flag of an inactive page in the inactive page link list to 0 to indicate the inactive page contained in the inactive page link list.
Optionally, the inactive page refers to a page that is not accessed within a preset time duration. The preset duration can be set by the terminal based on the duration setting instruction and can also be set when the terminal leaves a factory. The duration setting instruction includes, but is not limited to, a voice duration setting instruction, a click duration setting instruction, a text duration setting instruction, and the like. When the terminal acquires the page in the Linux system, the terminal can detect the page. When detecting that the page is not accessed within the preset time, the terminal may add the page to the inactive page linked list.
According to some embodiments, when the terminal detects that the memory of the Linux system is insufficient, the terminal may perform page recycling on the inactive pages included in the inactive page linked list. The terminal can obtain the memory of the Linux system and judge the memory. When the terminal judges that the memory is insufficient, the terminal can acquire the inactive page linked list and carry out page recycling on the inactive pages contained in the inactive page linked list.
And S102, when the current page unit of the inactive page linked list has a page which fails to be recovered, adding the page which fails to be recovered to the temporary page linked list.
According to some embodiments, the temporary page list is a list used to temporarily store pages for which reclamation failed. When the terminal carries out page recovery on the inactive pages contained in the inactive page linked list, the terminal can carry out recovery in page units. The page unit may include, for example, a preset number of pages. But the recovery of the inactive page by the terminal has the situations of recovery success and recovery failure.
It is easy to understand that when the terminal detects that the memory of the Linux system is insufficient, the terminal can perform page recycling on the inactive pages included in the inactive page linked list. When the terminal recovers the inactive page, the terminal can recover the inactive page in units of pages. The current page unit refers to a unit where a page being scanned is located when the terminal performs page recycling, and the current page unit does not refer to a fixed unit. When the terminal performs page recovery on the current page unit of the inactive page linked list, the terminal may detect whether a page failed in recovery exists in the current page unit. When the terminal detects that the page which fails to be recovered exists in the current page unit, the terminal can add the page which fails to be recovered to the temporary page linked list.
It is easy to understand that when the terminal detects that the recovery of the a7 page fails when the terminal includes the a1 page, the a2 page, the A3 page, the a4 page, the a5 page, the a6 page, and the a7 page in the current page unit, the terminal may add the a7 page to the temporary page chain table.
Step S103, acquiring a next page unit of the current page unit of the inactive page linked list, taking the next page unit as the current page unit, and executing the step of adding the page which fails to be recovered to the temporary page linked list when the page which fails to be recovered exists in the current page unit of the inactive page linked list.
According to some embodiments, when the terminal has a page which fails to be recycled in the current page unit of the inactive page linked list and adds the page which fails to be recycled to the temporary page linked list, the terminal may obtain a next page unit of the current page unit of the inactive page linked list. And the pages contained in the next page unit are the pages with the preset number in the rest inactive pages contained in the inactive page linked list after the page recovery of the current page unit is finished. Because the terminal adds the page which fails to be recovered in the current page unit to the temporary page linked list, the page which fails to be recovered cannot be included in the next page unit acquired by the terminal.
It is easy to understand that, when the terminal acquires the next page unit of the current page unit, the terminal may use the next page unit as the current page unit, and execute the step of adding the page that fails to be recovered to the temporary page linked list when the page that fails to be recovered exists in the current page unit of the inactive page linked list. When the terminal recovers the page contained in the next page unit, the terminal cannot recover the page in the temporary page linked list.
Optionally, when the terminal acquires the next page unit of the current page unit of the inactive page linked list, the terminal may perform page recycling on the page included in the next page unit. When the terminal detects that the page which fails to be recovered exists in the next page unit, the terminal can add the page which fails to be recovered in the next page unit to the temporary page linked list. For example, when the next page unit includes B1 page, B2 page, B3 page, B4 page, B5 page, B6 page, and B7 page, and the terminal detects that the recovery of B7 page fails, the terminal may add B7 page to the temporary page link list.
In one or more embodiments of the present application, when detecting that the memory of the Linux system is insufficient, a page recovery may be performed on an inactive page included in an inactive page chain table, and when a page that fails to be recovered exists in a current page unit of the inactive page chain table, the page that fails to be recovered may be added to a temporary page chain table, so that when a page recovery is performed in a next page unit of the current page unit of the inactive page chain table, the page that fails to be recovered in the current recovery unit may not be recovered, a recovery step of the next page unit is simplified, a page recovery time of the next page unit is reduced, a page recovery duration and a recovery step of the inactive page chain table may be reduced, and thus, a recovery efficiency of the page may be improved.
Please refer to fig. 3, which is a flowchart illustrating a page recycling method according to an embodiment of the present disclosure. As shown in fig. 3, the method of the embodiment of the present application may include the following steps S201 to S205.
Step S201, a temporary page linked list is created after the inactive page linked list.
According to some embodiments, after the terminal completes the creation of the inactive page linked list, the terminal may create a temporary page linked list after the inactive page linked list. The terminal creates a temporary page linked list after the inactive page linked list, and can add the page which fails to be recovered to the temporary page linked list when the page which fails to be recovered exists in the inactive page linked list so as to improve the recovery efficiency of the page.
It is easily understood that when the terminal creates the inactive page linked list, the terminal may create the inactive page linked list of the first length. The terminal may create an inactive page link list of the first length based on the number of pages and the access frequency of the pages. After the terminal creates the inactive page linked list of the first length, the terminal may create a temporary page linked list of a second length. The first length and the second length do not refer to a fixed length, and the lengths may be set accordingly based on the length setting instruction.
Step S202, when detecting that the memory of the Linux system is insufficient, page recycling is carried out on the inactive pages contained in the inactive page linked list.
The specific process is as described above, and is not described herein again.
According to some embodiments, please refer to fig. 4, which is a flowchart illustrating a method for pre-reading a document page according to an embodiment of the present disclosure. As shown in fig. 4, when detecting that the memory of the Linux system is insufficient, the method according to the embodiment of the present application may include the following steps S301 to S302 when performing page recycling on the inactive pages included in the inactive page linked list. Step S301, acquiring an idle memory page of the Linux system; step S302, when the number of idle memory pages is smaller than the first number threshold, performing page reclamation on the inactive pages included in the inactive page linked list.
According to some embodiments, when the terminal detects whether the memory of the Linux system is sufficient, the terminal may obtain the idle memory page of the Linux system, that is, the terminal may obtain the idle memory page that is not subjected to the write operation in the Linux system. When the terminal acquires the idle memory pages, the terminal may detect whether the number of the idle memory pages is less than a first number threshold. When the terminal detects that the number of the idle memory pages is smaller than the first number threshold, the terminal can perform page recycling on the inactive pages contained in the inactive page linked list.
It is easy to understand that the first quantity threshold merely refers to a quantity threshold corresponding to a free memory page in the Linux system, and does not refer to a certain fixed quantity threshold. For example, the first number threshold set by the terminal based on the threshold setting instruction may be 15 pages, and the first number threshold set by the terminal based on the threshold setting instruction may also be 25 pages. Wherein the threshold setting instruction includes but is not limited to a voice threshold setting instruction, a text threshold setting instruction, a click threshold setting instruction, and the like.
Alternatively, the first number threshold may be, for example, 10 pages. When the terminal acquires that the idle memory pages of the Linux system are the pages a1, a2 and A3, and the terminal detects that the number of the idle memory pages 3 is less than the first number threshold 10, the terminal can perform page recycling on the inactive pages contained in the inactive page linked list.
According to some embodiments, please refer to fig. 5, which provides a flowchart of a document page pre-reading method according to an embodiment of the present application. As shown in fig. 5, when detecting that the memory of the Linux system is insufficient, the method according to the embodiment of the present application may include the following steps S401 to S402 when performing page recycling on the inactive pages included in the inactive page linked list. Step S401, when detecting that the memory of the Linux system is insufficient, acquiring the page number of the inactive page linked list; step S402, when the number of the pages is smaller than the second number threshold, adding the pages in the active page linked list into the inactive page linked list, and recovering the pages in the inactive pages contained in the inactive page linked list.
According to some embodiments, referring to fig. 6, when the terminal detects that the memory of the Linux system is insufficient, the terminal performs memory recovery, that is, the terminal may obtain the inactive page linked list. At this time, the terminal may obtain the page number of the inactive page linked list, that is, the terminal may obtain the page number of the inactive page included in the inactive page. When the terminal acquires the page number, the terminal may detect a size relationship between the page number and the second number threshold. When the terminal detects that the number of the pages is smaller than the second number threshold, the terminal may add the pages in the active page linked list to the inactive page linked list. When the number of pages in the inactive page linked list is equal to the second number threshold, the terminal may perform page recycling on the inactive pages included in the inactive page linked list.
It is easy to understand that when the terminal performs page retrieval on the inactive pages included in the inactive page linked list, the terminal may obtain the difference quantity between the page quantity and the second quantity threshold. When the terminal obtains the difference quantity, the terminal may add the page with the difference quantity in the active page linked list to the inactive page linked list. When the terminal adds the pages with the difference quantity in the active page linked list to the inactive page linked list, the terminal can add the pages with the difference quantity to the inactive page linked list from the tail to the head of the active page linked list. The terminal can add the page to the active page linked list according to the accessed time point. The page at the tail of the active page linked list is the time point when the terminal has visited earlier, so the pages in the active page linked list include but are not limited to active pages and inactive pages.
Alternatively, the second number threshold may be, for example, 20 pages. The number of pages of the inactive page included in the inactive page acquired by the terminal may be, for example, 10 pages. When the terminal detects that the page number is less than 10 pages and less than 20 pages, the terminal may add the pages in the active page linked list to the inactive page linked list, that is, the terminal may add the 10 pages in the active page linked list to the inactive page linked list.
According to some embodiments, please refer to fig. 7, which is a flowchart illustrating a method for pre-reading a document page according to an embodiment of the present disclosure. As shown in fig. 7, when a page that fails to be recycled exists in a current page unit of an inactive page linked list, the method according to the embodiment of the present application may further include the following steps S501 to S505 after adding the page that fails to be recycled to the temporary page linked list. Step S501, when the page recovery of the inactive page linked list is finished, acquiring the number of idle memory pages in the memory of the Linux system; step S502, when the number of idle memory pages in the memory is greater than a first number threshold, ending page recycling; step S503, acquiring page state information of a page which fails to be recovered once every preset time length; step S504, when the page state information meets the preset requirement, adding the page which fails to be recovered into the inactive page linked list; step S505, when the number of idle memory pages in the memory is smaller than the first number threshold, the pages of the temporary page linked list are recycled.
According to some embodiments, when a page which fails to be recovered exists in a current page unit of the inactive page linked list and the page which fails to be recovered is added to the temporary page linked list, the terminal can detect whether the page recovery of the inactive page linked list is completed. When the terminal detects that the page recovery of the inactive page linked list is completed, the terminal can acquire the number of idle memory pages in the memory of the Linux system. When the terminal acquires the number of the idle memory pages in the memory of the Linux system, the terminal can detect the size relationship between the number of the idle memory pages in the memory of the Linux system and the first number threshold. When the terminal detects that the number of the idle memory pages in the memory of the Linux system is greater than the first number threshold, the terminal can end page recycling.
It will be readily appreciated that the first number threshold may be, for example, 10 pages. When the terminal detects that the page recovery of the inactive page linked list is completed, the number of idle memory pages in the memory of the Linux system acquired by the terminal may be 15 pages, for example. When the terminal detects that the number of the idle memory pages in the memory of the Linux system is 15 pages and is greater than the first number threshold value of 10 pages, the terminal may end page recycling.
According to some embodiments, when the page recovery of the inactive page linked list is completed, the terminal may obtain the number of idle memory pages in the memory of the Linux system. When the terminal detects that the number of the idle memory pages in the memory is greater than the first number threshold, the terminal may end page recycling. At this time, the terminal may obtain page state information of the page that fails to be recycled once every preset duration. When the terminal acquires the page state information of the page which fails to be recovered, the terminal can detect whether the page state information of the page which fails to be recovered meets a preset requirement. When the terminal detects that the page state information meets the preset requirement, the terminal can add the page which fails to be recovered into the inactive page linked list. The terminal adds the page which fails to be recovered into the inactive page linked list, can recover the page when the page recovery is carried out on the inactive page contained in the inactive page linked list, can reduce the condition that the input/output IO load of the terminal is aggravated by recovering the page which is not visited for a long time when the input/output IO load is higher, can improve the speed of the page recovery, and further can improve the recovery efficiency of the page.
It is easily understood that the preset time period may be, for example, 5 minutes. When the terminal adds the page which fails to be recovered in the current page unit to the temporary page linked list, the terminal can acquire the page state information of the page which fails to be recovered every 5 minutes. When the terminal acquires that the page state information of the page with the recovery failure is in a recoverable state, the terminal can add the page with the recovery failure to the inactive page linked list.
According to some embodiments, after the terminal detects that a recovery-failed page exists in a current page unit of the inactive page linked list and adds the recovery-failed page to the temporary page linked list, the terminal can acquire the number of idle memory pages in the memory of the Linux system. When the terminal detects that the number of the idle memory pages in the memory is smaller than the first number threshold, the terminal can acquire the temporary page linked list. When detecting that the recyclable pages exist in the temporary page linked list, the terminal can recycle the pages of the temporary page linked list. The terminal can recycle the pages of the temporary page linked list so as to enable the number of the idle memory pages in the memory of the Linux system to be greater than a first number threshold value.
It will be readily appreciated that the first number threshold may be, for example, 10 pages. When the terminal detects that the page recovery of the inactive page linked list is completed, the number of idle memory pages in the memory of the Linux system acquired by the terminal may be 8 pages, for example. When the terminal detects that the number of the idle memory pages in the memory of the Linux system is 8 pages less than the first number threshold of 10 pages, the terminal can recycle the pages of the temporary page linked list. When the page recovery of the temporary page linked list is completed by the terminal, the terminal can acquire the number of idle memory pages in the memory of the Linux system again. When the terminal detects that the number of the idle memory pages in the memory of the Linux system is greater than the first number threshold, the terminal can end page recycling. When the terminal detects that the number of the idle memory pages in the memory of the Linux system is smaller than the first number threshold, the terminal can send prompt information so that a user can know the information that the memory of the Linux system is insufficient in time.
In step S203, when a page that fails to be recycled exists in the current page unit of the inactive page linked list, the page that fails to be recycled is added to the temporary page linked list.
The specific process is as described above, and is not described herein again.
According to some embodiments, the page that failed reclamation includes, but is not limited to, a page that is being written back, a user-set non-reclaimable page, and the like.
Step S204, acquiring the next page unit of the current page unit of the inactive page linked list, taking the next page unit as the current page unit, and executing the step of adding the page which fails to be recovered to the temporary page linked list when the page which fails to be recovered exists in the current page unit of the inactive page linked list.
The specific process is as described above, and is not described herein again.
It is easy to understand that, when the terminal detects that the page recycling of the current page unit is completed, the terminal may detect whether the next page unit exists in the inactive page linked list. When the terminal detects that the next page unit exists in the inactive page linked list, the terminal can acquire the next page unit, take the next page unit as the current page unit, and execute the step of adding the page which fails to be recovered to the temporary page linked list when the page which fails to be recovered exists in the current page unit of the inactive page linked list.
Step S205, when it is detected that the memory of the Linux system is insufficient and the inactive page linked list does not include an inactive page, the page of the temporary page linked list is recycled.
According to some embodiments, when the terminal detects that the memory of the Linux system is insufficient, the terminal may obtain the inactive page linked list. When the terminal detects that the inactive page list does not contain the inactive pages, the terminal can directly recycle the pages contained in the temporary page list, so that the number of idle memory pages in the memory of the Linux system is larger than a first number threshold.
According to some embodiments, when the terminal retrieves the pages of the temporary page linked list, the terminal may release the pages of the temporary page linked list back into the inactive linked list, and retrieve the pages in the inactive linked list. For example, when the terminal detects that the memory of the Linux system is insufficient, and the inactive page chain table does not contain the inactive page, when the page of the temporary page chain table is recovered, the terminal can release the page in the temporary page chain table into the inactive page chain table, when the terminal recovers the page contained in the inactive page chain table, the page recovery can be performed on the page released from the temporary page chain table to the inactive page chain table, the page recovery frequency can be reduced, the page released from the temporary page chain table can be simultaneously recovered when the inactive page is recovered, and the page recovery efficiency can be improved.
It is easy to understand that when the terminal retrieves the page in the temporary page linked list, the terminal can directly retrieve the page in the temporary page linked list without releasing the page back into the inactive page linked list, so that the page release time can be reduced, the page retrieval time can be reduced, and the page retrieval efficiency can be improved.
In one or more embodiments of the present application, the terminal creates the temporary page chain table after the inactive page chain table, and when there is a page that fails to be recovered in a current page unit of the inactive page chain table, the page that fails to be recovered is added to the temporary page chain table, so that when a next page unit of the current page unit of the inactive page chain table performs page recovery, the page that fails to be recovered in the current recovery unit may not be recovered, a recovery step of the next page unit is simplified, page recovery time of the next page unit is reduced, page recovery duration and a recovery step of the inactive page chain table may be reduced, and thus page recovery efficiency may be improved. Secondly, when the terminal detects that the memory of the Linux system is insufficient and the inactive page chain table does not contain the inactive page, the terminal can recycle the page of the temporary page chain table, so that the memory of the Linux system is sufficient, the memory requirement of the terminal can be met while the page recycling efficiency is improved, and the use convenience of the Linux system can be improved.
The page recycling device provided by the embodiment of the present application will be described in detail below with reference to fig. 8. It should be noted that the page recycling apparatus shown in fig. 8 is used for executing the method of the embodiment shown in fig. 2 to 7 of the present application, and for convenience of description, only the portion related to the embodiment of the present application is shown, and details of the specific technology are not disclosed, please refer to the embodiment shown in fig. 2 to 7 of the present application.
Please refer to fig. 8, which illustrates a schematic structural diagram of a page recycling device according to an embodiment of the present application. The page recycling apparatus 800 may be implemented by software, hardware or a combination of both as all or a part of the user terminal. According to some embodiments, the page recycling apparatus 800 includes a page recycling unit 801, a page adding unit 802, and a page unit obtaining unit 803, and is specifically configured to:
the page recovery unit 801 is configured to perform page recovery on an inactive page included in an inactive page linked list when detecting that a memory of the Linux system is insufficient;
the page adding unit 802 is configured to add a page with a recovery failure to the temporary page linked list when the current page unit of the inactive page linked list has a page with a recovery failure;
the page unit obtaining unit 803 is configured to obtain a next page unit of a current page unit of the inactive page linked list, use the next page unit as the current page unit, and perform a step of adding a page that fails to be recovered to the temporary page linked list when a page that fails to be recovered exists in the current page unit of the inactive page linked list.
According to some embodiments, fig. 9 shows a schematic structural diagram of a page recycling device according to an embodiment of the present application. As shown in fig. 9, the page recovery unit 801 includes a page obtaining subunit 8011 and a page recovery subunit 8012, where the page recovery unit 801 is configured to, when detecting that a memory of the Linux system is insufficient and performing page recovery on an inactive page included in an inactive page linked list, the page obtaining subunit 8011 is configured to obtain an idle memory page of the Linux system; the page reclaim sub-unit 8012 is configured to perform page reclaim on an inactive page included in an inactive page chain table when the number of idle memory pages is smaller than a first number threshold.
According to some embodiments, the page recycling unit 801 is configured to, when detecting that a memory of the Linux system is insufficient and performing page recycling on an inactive page included in an inactive page linked list, specifically:
when detecting that the memory of the Linux system is insufficient, acquiring the page number of the inactive page linked list;
and when the number of the pages is less than a second number threshold, adding the pages in the active page linked list into the inactive page linked list, and recovering the pages in the inactive pages contained in the inactive page linked list.
According to some embodiments, the page recycling apparatus 800 further includes a page recycling ending unit 804, configured to, when a page that fails to be recycled exists in a current page unit of the inactive page linked list, add the page that fails to be recycled to the temporary page linked list, and when the page recycling of the inactive page linked list is completed, obtain the number of idle memory pages in the memory of the Linux system;
and when the number of the idle memory pages in the memory is larger than the first number threshold, ending the page recycling.
According to some embodiments, the page recycling unit 801 is further configured to, when the page recycling of the inactive page linked list is completed, after obtaining the number of idle memory pages in the memory of the Linux system, and when the number of idle memory pages in the memory is smaller than a first number threshold, recycle the pages of the temporary page linked list.
According to some embodiments, fig. 10 shows a schematic structural diagram of a page recycling device according to an embodiment of the present application. As shown in fig. 10, the page adding unit 802 includes an information obtaining subunit 8021 and a page recycling subunit 8022, where the information obtaining subunit 8021 is configured to, when the number of idle memory pages in the memory is greater than a first number threshold, obtain page state information of a page that is failed to be recycled every preset time length after finishing page recycling;
the page recycling subunit 8022 is configured to add a page that fails to be recycled to the inactive page linked list when the page state information meets a preset requirement.
According to some embodiments, the page recycling apparatus 800 further includes a linked list creating unit 805, configured to create a temporary page linked list after the inactive page linked list before performing page recycling on the inactive pages included in the inactive page linked list when detecting that the memory of the Linux system is insufficient.
According to some embodiments, the page recycling unit 801 is further configured to recycle the pages of the temporary page chain table when it is detected that the memory of the Linux system is insufficient and the inactive page chain table does not include the inactive page.
According to some embodiments, the page recycling unit 801 is further configured to, when recycling the pages of the temporary page linked list, specifically:
and releasing the pages of the temporary page linked list back to the inactive linked list, and recovering the pages in the inactive linked list.
In one or more embodiments of the present application, when detecting that a memory of a Linux system is insufficient, a page recovery unit may perform page recovery on an inactive page included in an inactive page linked list, and when a page that fails to be recovered exists in a current page unit of the inactive page linked list, a page addition unit may add the page that fails to be recovered to a temporary page linked list, so that a page unit acquisition unit may acquire a next page unit of the current page unit of the inactive page linked list, and may use the next page unit as the current page unit, and perform a step of adding the page that fails to be recovered to the temporary page linked list when the page that fails to be recovered exists in the current page unit of the inactive page linked list. Therefore, when the next page unit of the current page unit of the inactive page linked list is used for page recovery, the page recovery device can not recover the page which fails to be recovered in the current recovery unit, simplify the recovery step of the next page unit, reduce the page recovery time and the recovery step of the inactive page linked list, and further improve the recovery efficiency of the page.
Please refer to fig. 11, which is a schematic structural diagram of a terminal according to an embodiment of the present disclosure. As shown in fig. 11, the terminal 1100 may include: at least one processor 1101, at least one network interface 1104, a user interface 1103, a memory 1105, at least one communication bus 1102.
Wherein a communication bus 1102 is used to enable connective communication between these components.
The user interface 1103 may include a Display screen (Display) and a GPS, and the optional user interface 1103 may also include a standard wired interface and a wireless interface.
The network interface 1104 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface).
The Memory 1105 may include a Random Access Memory (RAM) or a Read-Only Memory (Read-Only Memory). Optionally, the memory 1105 includes non-transitory computer-readable storage media. The memory 1105 may be used to store instructions, programs, code, sets of codes, or sets of instructions. The memory 1105 may include a stored program area and a stored data area, wherein the stored program area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing the various method embodiments described above, and the like; the storage data area may store data and the like referred to in the above respective method embodiments. The memory 1105 may alternatively be at least one storage device located remotely from the processor 1101. As shown in fig. 11, a memory 1105, which is a kind of computer storage medium, may include therein an operating system, a network communication module, a user interface module, and an application program for page reclamation.
In the terminal 1100 shown in fig. 11, the user interface 1103 is mainly used as an interface for providing input for a user, and acquiring data input by the user; and the processor 1101 may be configured to invoke an application program for page eviction stored in the memory 1105, and specifically perform the following operations:
when the memory of the Linux system is detected to be insufficient, page recovery is carried out on the inactive pages contained in the inactive page linked list;
when a page which fails to be recovered exists in the current page unit of the inactive page linked list, adding the page which fails to be recovered to the temporary page linked list;
and acquiring a next page unit of the current page unit of the inactive page linked list, taking the next page unit as the current page unit, and executing the step of adding the page which fails to be recovered to the temporary page linked list when the page which fails to be recovered exists in the current page unit of the inactive page linked list.
According to some embodiments, the processor 1101 is configured to execute the following steps when detecting that a memory of the Linux system is insufficient and performing page recovery on an inactive page included in an inactive page linked list:
acquiring a free memory page of the Linux system;
and when the number of the idle memory pages is smaller than a first number threshold value, page recovery is carried out on the inactive pages contained in the inactive page linked list.
According to some embodiments, the processor 1101 is configured to execute the following steps when detecting that a memory of the Linux system is insufficient and performing page recovery on an inactive page included in an inactive page linked list:
when detecting that the memory of the Linux system is insufficient, acquiring the page number of the inactive page linked list;
and when the number of the pages is less than a second number threshold, adding the pages in the active page linked list into the inactive page linked list, and recovering the pages in the inactive pages contained in the inactive page linked list.
According to some embodiments, the processor 1101 is configured to, when there is a page that fails to be recycled in the current page unit of the inactive page linked list, add the page that fails to be recycled to the temporary page linked list, further specifically perform the following steps:
when the page recovery of the inactive page linked list is finished, acquiring the number of idle memory pages in a memory of the Linux system;
and when the number of the idle memory pages in the memory is larger than the first number threshold, ending the page recycling.
According to some embodiments, the processor 1101 is configured to, after acquiring the number of free memory pages in the memory of the Linux system when the page recycling of the inactive page linked list is completed, further specifically configured to perform the following steps:
and when the number of the idle memory pages in the memory is smaller than a first number threshold value, recovering the pages of the temporary page linked list.
According to some embodiments, the processor 1101 is configured to, when the number of free memory pages in the memory is greater than the first number threshold and after ending the page reclamation, further specifically configured to perform the following steps:
acquiring page state information of a page which fails to be recovered once every preset time length;
and when the page state information meets the preset requirement, adding the page which fails to be recovered into the inactive page linked list.
According to some embodiments, the processor 1101 is configured to, when detecting that the memory of the Linux system is insufficient, before performing page recycling on the inactive pages included in the inactive page linked list, further specifically perform the following steps:
a temporary page linked list is created after the inactive page linked list.
According to some embodiments, the processor 1101 is further specifically configured to perform the steps of:
and when the memory of the Linux system is detected to be insufficient and the inactive page chain table does not contain the inactive page, the page of the temporary page chain table is recycled.
According to some embodiments, when the processor 1101 is configured to retrieve the page of the temporary page link list, it is specifically configured to perform the following steps:
and releasing the pages of the temporary page linked list back to the inactive linked list, and recovering the pages in the inactive linked list.
In one or more embodiments of the present application, when detecting that a memory of a Linux system is insufficient, a terminal may perform page recycling on an inactive page included in an inactive page chain table, and when a page that fails to be recycled exists in a current page unit of the inactive page chain table, the terminal may add the page that fails to be recycled to a temporary page chain table, so that when performing page recycling in a next page unit of the current page unit of the inactive page chain table, the terminal may not recycle the page that fails to be recycled in the current recycling unit, simplify a recycling step of the next page unit, reduce a page recycling time of the next page unit, reduce a page recycling duration and a recycling step of the inactive page chain table, and further improve a page recycling efficiency.
The present application also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the above-described method. The computer-readable storage medium may include, but is not limited to, any type of disk including floppy disks, optical disks, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.
Embodiments of the present application also provide a computer program product comprising a non-transitory computer readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any one of the page reclamation methods as recited in the above method embodiments.
It is clear to a person skilled in the art that the solution of the present application can be implemented by means of software and/or hardware. The "unit" and "module" in this specification refer to software and/or hardware that can perform a specific function independently or in cooperation with other components, where the hardware may be, for example, a Field-ProgrammaBLE Gate Array (FPGA), an Integrated Circuit (IC), or the like.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implementing, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some service interfaces, devices or units, and may be an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable memory. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a memory, and including several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned memory comprises: various media capable of storing program codes, such as a usb disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program, which is stored in a computer-readable memory, and the memory may include: flash disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
The above description is only an exemplary embodiment of the present disclosure, and the scope of the present disclosure should not be limited thereby. That is, all equivalent changes and modifications made in accordance with the teachings of the present disclosure are intended to be included within the scope of the present disclosure. Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
Claims (12)
1. A method for page reclamation, the method comprising:
when the memory of the Linux system is detected to be insufficient, page recovery is carried out on the inactive pages contained in the inactive page linked list;
when a page which fails to be recovered exists in the current page unit of the inactive page linked list, adding the page which fails to be recovered to a temporary page linked list;
and acquiring a next page unit of the current page unit of the inactive page linked list, taking the next page unit as the current page unit, and executing the step of adding the page which fails to be recovered to a temporary page linked list when the page which fails to be recovered exists in the current page unit of the inactive page linked list.
2. The method according to claim 1, wherein when the memory shortage of the Linux system is detected, performing page reclamation on the inactive pages included in the inactive page linked list comprises:
acquiring an idle memory page of the Linux system;
and when the number of the idle memory pages is smaller than a first number threshold, performing page recovery on the inactive pages contained in the inactive page linked list.
3. The method according to claim 1, wherein when the memory shortage of the Linux system is detected, performing page reclamation on the inactive pages included in the inactive page linked list comprises:
when the memory of the Linux system is detected to be insufficient, acquiring the page number of the inactive page linked list;
and when the number of the pages is smaller than a second number threshold, adding the pages in the active page linked list into the inactive page linked list, and recovering the pages in the inactive pages contained in the inactive page linked list.
4. The method of claim 1, wherein when there is a page that fails to be recycled in a current page unit of the inactive page linked list, adding the page that fails to be recycled after the page that fails to be recycled to the temporary page linked list, further comprises:
when the page recovery of the inactive page linked list is finished, acquiring the number of idle memory pages in the memory of the Linux system;
and when the number of the idle memory pages in the memory is larger than a first number threshold, ending page recycling.
5. The method according to claim 4, wherein after acquiring the number of idle memory pages in the memory of the Linux system when the page recycling of the inactive page linked list is completed, the method further comprises:
and when the number of the idle memory pages in the memory is smaller than a first number threshold, recovering the pages of the temporary page linked list.
6. The method of claim 4, wherein after ending page eviction when the number of free memory pages in the memory is greater than a first number threshold, further comprising:
acquiring page state information of the page with the recovery failure every preset time length;
and when the page state information meets the preset requirement, adding the page failed in recovery into the inactive page linked list.
7. The method according to claim 1, wherein before performing page eviction on the inactive pages included in the inactive page linked list when detecting that the memory of the Linux system is insufficient, the method further comprises:
creating the temporary page linked list after the inactive page linked list.
8. The method of claim 1, further comprising:
and when the memory of the Linux system is detected to be insufficient and the inactive page linked list does not contain the inactive page, the page of the temporary page linked list is recycled.
9. The method of claim 5 or 8, wherein the recycling the pages of the temporary page link list comprises:
and releasing the pages of the temporary page linked list back to the inactive linked list, and recovering the pages in the inactive linked list.
10. A page recycling apparatus, the apparatus comprising:
the page recovery unit is used for recovering the pages of the inactive pages contained in the inactive page linked list when detecting that the memory of the Linux system is insufficient;
the page adding unit is used for adding the page with the recovery failure to the temporary page linked list when the page with the recovery failure exists in the current page unit of the inactive page linked list;
and the page unit acquiring unit is used for acquiring a next page unit of the current page unit of the inactive page linked list, taking the next page unit as the current page unit, and executing the step of adding the page which fails to be recovered to the temporary page linked list when the page which fails to be recovered exists in the current page unit of the inactive page linked list.
11. A terminal comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the method of any of the preceding claims 1-9 when executing the computer program.
12. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, is adapted to carry out the method of any one of the preceding claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011116674.XA CN112181863B (en) | 2020-10-19 | 2020-10-19 | Page recycling method, device, terminal and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011116674.XA CN112181863B (en) | 2020-10-19 | 2020-10-19 | Page recycling method, device, terminal and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112181863A true CN112181863A (en) | 2021-01-05 |
| CN112181863B CN112181863B (en) | 2024-06-14 |
Family
ID=73949743
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011116674.XA Active CN112181863B (en) | 2020-10-19 | 2020-10-19 | Page recycling method, device, terminal and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112181863B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103365784A (en) * | 2013-06-27 | 2013-10-23 | 华为技术有限公司 | Method and device for memory recycle and allocation |
| CN104008061A (en) * | 2013-02-22 | 2014-08-27 | 华为技术有限公司 | Internal memory recovery method and device |
| US20150243373A1 (en) * | 2014-02-23 | 2015-08-27 | Qualcomm Incorporated | Kernel masking of dram defects |
| CN108205498A (en) * | 2017-08-01 | 2018-06-26 | 珠海市魅族科技有限公司 | Method for recovering internal storage and device, computer installation and computer readable storage medium |
| CN108664411A (en) * | 2018-05-03 | 2018-10-16 | 晶晨半导体(上海)股份有限公司 | A kind of memory chained list and the optimization method of memory management |
| CN111782397A (en) * | 2020-07-01 | 2020-10-16 | 浪潮云信息技术股份公司 | Shielding method of Linux page replacement mechanism |
-
2020
- 2020-10-19 CN CN202011116674.XA patent/CN112181863B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104008061A (en) * | 2013-02-22 | 2014-08-27 | 华为技术有限公司 | Internal memory recovery method and device |
| CN103365784A (en) * | 2013-06-27 | 2013-10-23 | 华为技术有限公司 | Method and device for memory recycle and allocation |
| US20150243373A1 (en) * | 2014-02-23 | 2015-08-27 | Qualcomm Incorporated | Kernel masking of dram defects |
| CN108205498A (en) * | 2017-08-01 | 2018-06-26 | 珠海市魅族科技有限公司 | Method for recovering internal storage and device, computer installation and computer readable storage medium |
| CN108664411A (en) * | 2018-05-03 | 2018-10-16 | 晶晨半导体(上海)股份有限公司 | A kind of memory chained list and the optimization method of memory management |
| CN111782397A (en) * | 2020-07-01 | 2020-10-16 | 浪潮云信息技术股份公司 | Shielding method of Linux page replacement mechanism |
Non-Patent Citations (1)
| Title |
|---|
| 彭青松;丁祥武;: "一种改进的自适应页面置换算法", 计算机应用与软件, no. 02 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112181863B (en) | 2024-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106712179B (en) | Method and device for realizing reverse charging | |
| CN109359091B (en) | File management method, device, terminal and computer readable storage medium | |
| CN109587252A (en) | Loading method, device, electronic equipment and the storage medium of operator parameter | |
| CN114827914B (en) | Short message processing method and device and electronic equipment | |
| CN103106109A (en) | Mobile communication device and application interface switching method | |
| CN112055424A (en) | Electronic device and method for switching electronic device | |
| CN112464095B (en) | Message pushing method, device, terminal and storage medium | |
| CN105100449A (en) | Picture sharing method and mobile terminal | |
| CN106776908B (en) | Data cleaning method and device and terminal | |
| CN112486733B (en) | System restoration method, device, terminal and storage medium | |
| CN108762983B (en) | Multimedia data recovery method and device | |
| KR20070063132A (en) | Apparatus and method for manage a bad block | |
| WO2021254200A1 (en) | Page thrashing protection method and apparatus for memory reclaim of operating system | |
| CN101674356B (en) | Electronic device and method thereof for shortening operation response time | |
| CN113412480B (en) | Mounting processing method, mounting processing device, electronic equipment and computer readable storage medium | |
| CN112181863B (en) | Page recycling method, device, terminal and storage medium | |
| CN112506460A (en) | Screen control authority sharing method and device, terminal and storage medium | |
| CN112114965A (en) | Application program running method and device, terminal and storage medium | |
| CN108804258B (en) | Data recovery method and device, mobile terminal and storage medium | |
| CN113098859B (en) | Webpage page rollback method, device, terminal and storage medium | |
| CN115587049A (en) | Memory recovery method and device, electronic equipment and storage medium | |
| CN112052089B (en) | Memory recovery method and device and electronic equipment | |
| CN114546171A (en) | Data distribution method, data distribution device, storage medium and electronic equipment | |
| CN112988097A (en) | Display screen control method and device, storage medium and mobile terminal | |
| CN112541141A (en) | Control display callback method, device, terminal and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |