Memory management method in embedded system

US9317425B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9317425-B2
Application numberUS-201414509385-A
CountryUS
Kind codeB2
Filing dateOct 8, 2014
Priority dateMay 9, 2014
Publication dateApr 19, 2016
Grant dateApr 19, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A memory management method in an embedded system is provided. The method includes a first iteration step that sequentially allocates and deletes memory, and recognizes an area where the first to last sections of the memory were located as a hollow space list A second iteration step sequentially allocates the memory in an area of the hollow space list by starting the memory allocation from an end point of the hollow space list. When the hollow space list is insufficient, allocates a memory section outside the area of the hollow space list, re-recognizes the hollow space list by expanding to the area where the last section of the memory was located. When the hollow space list is sufficient during the memory allocation, maintains the hollow space list, and sequentially deletes the allocated memory. Further, an initialization step initializes the hollow space list of when the hollow space list is re-recognized.

First claim

Opening claim text (preview).

What is claimed is: 1. A memory management method in an embedded system, comprising: first iteration of sequentially allocating and deleting, by a processor, memory and recognizing an area when the first to last sections of the memory were located as a hollow space list; second iteration of sequentially allocating, by the processor, the memory in an area of the hollow space list by starting memory allocation from an end point of the hollow space list, when the hollow space list is insufficient during the memory allocation, allocating a memory section outside the area of the hollow space list, re-recognizing the hollow space list by expanding to the area when the last section of the memory was located, when the hollow space list is sufficient during the memory allocation, maintaining the hollow space list, and sequentially deleting the allocated memory; and when the hollow space list is re-recognized, initializing, by the processor, the hollow space list. 2. The memory management method according to claim 1 , wherein, at the first iteration, memory allocation starts from a first hollow space and, after the first hollow space, sequentially allocating, by the processor, the memory. 3. The memory management method according to claim 1 , wherein, at the second iteration, the memory is sequentially allocated, by the processor, in an opposite direction from an end point to a starting point of the hollow space list. 4. The memory management method according to claim 3 , wherein, at the second iteration, when the hollow space list is insufficient, the memory is allocated, by the processor, to an outside area of the end point of the hollow space list. 5. The memory management method according to claim 1 , wherein, when the hollow space list is initialized, iteration is repeated from the first iteration. 6. The memory management method according to claim 1 , wherein, at the second iteration, when the hollow space list is maintained, the second iteration is repeated during next iteration. 7. A memory management method, comprising: sequentially allocating and deleting, by a processor, memory starting from a first hollow space and recognizing, by the processor, an area when the memory is allocated as a hollow space list at initial iteration; when the hollow space list is recognized, allocating and deleting, by the processor, the memory in the area of the hollow space list; and when the hollow space list is expanded and re-recognized due to the hollow space list being insufficient, deleting, by the processor, the allocated memory, initializing the hollow space list, and then sequentially allocating the memory from the first hollow space. 8. A non-transitory computer readable medium containing program instructions executed by a processor or controller, the computer readable medium comprising: program instructions that perform a first iteration of sequentially allocating and deleting memory and recognizing an area when the first to last sections of the memory were located as a hollow space list; program instructions that perform a second iteration of sequentially allocating, the memory in an area of the hollow space list by starting memory allocation from an end point of the hollow space list, when the hollow space list is insufficient during the memory allocation, allocating a memory section outside the area of the hollow space list, re-recognizing the hollow space list by expanding to the area when the last section of the memory was located, when the hollow space list is sufficient during the memory allocation, maintaining the hollow space list, and sequentially deleting the allocated memory; and program instruction that initialize the hollow space list when the hollow space list is re-recognized. 9. The non-transitory computer readable medium of claim 8 , wherein, at the first iteration, memory allocation starts from a first hollow space and, after the first hollow space, sequentially allocating the memory. 10. The non-transitory computer readable medium of claim 8 , wherein, at the second iteration, the memory is sequentially allocated in an opposite direction from an end point to a starting point of the hollow space list. 11. The non-transitory computer readable medium of claim 10 , wherein, at the second iteration, when the hollow space list is insufficient, the memory is allocated to an outside area of the end point of the hollow space list. 12. The non-transitory computer readable medium of claim 8 , wherein, when the hollow space list is initialized, iteration is repeated from the first iteration. 13. The non-transitory computer readable medium of claim 8 , wherein, at the second iteration, when the hollow space list is maintained, the second iteration is repeated during next iteration.

Assignees

Inventors

Classifications

  • Space efficiency improvement · CPC title

  • Saving storage space on storage systems · CPC title

  • G06F12/023Primary

    Free address space management · CPC title

  • Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket · CPC title

  • Single storage device · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9317425B2 cover?
A memory management method in an embedded system is provided. The method includes a first iteration step that sequentially allocates and deletes memory, and recognizes an area where the first to last sections of the memory were located as a hollow space list A second iteration step sequentially allocates the memory in an area of the hollow space list by starting the memory allocation from an en…
Who is the assignee on this patent?
Hyundai Motor Co Ltd
What technology area does this patent fall under?
Primary CPC classification G06F12/023. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Apr 19 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).