Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Memory allocation

A memory and memory block technology, applied in the direction of memory system, memory address/allocation/relocation, instrument, etc., to achieve the effect of providing certainty and predictability and less memory

Inactive Publication Date: 2007-04-18
JALUNA
View PDF0 Cites 20 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Currently, traditional "first fit" and "best fit" algorithms do not meet these requirements

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Memory allocation
  • Memory allocation
  • Memory allocation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] According to an embodiment of the present invention, an algorithm is provided, which is characterized in that memory segments are allocated in different levels according to the size of the memory segments, different granularity sizes (powers of 2) are used for each level, and multi-level (multiple-stage) bitmaps to improve the speed at which requests to allocate memory blocks are processed.

[0029] More specifically, memory segments are allocated in seven levels according to the size of the memory segments. Defines the range of acceptable segment sizes for each class. Specifically, a granularity size is defined for each level, and 255 fixed different segment sizes are defined as multiples of the granularity size. The maximum segment size supported for a given class is

[0030] maxSegSize=2 N =256×G

[0031] where G is the granularity of the grade.

[0032] Each level represents a table containing pointers to a list of free memory segments of the size defined for t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

There is provided a method of managing a data memory in order to improve the processing of memory allocation requests. Memory segments are associated with different levels according to their size. A different granule size to the power of two is defined for each level. The granule size defines the range of segment sizes associated with each level. A multiple-stage bitmap is provided which indicates which of the levels contains free segments and the size of free segments. The bitmap is updated each time a memory segment is freed or allocated. Thereby, a deterministic ''Best Fit'' approach is provided which permits the allocation and release of memory segments at both task and interrupt level and which reduces memory fragmentation.

Description

technical field [0001] The invention relates to a method of processing requests for allocation of memory blocks of a data storage, and to a method of managing a data storage. Background technique [0002] The operating system uses a memory allocator to allocate free memory upon request from an application. In hardware using a page memory management unit (PMMU), memory is divided into fixed-size memory pages. Therefore, a simple way to allocate memory is to allocate free fixed-size memory pages. A disadvantage of this method is that it is not flexible, especially for applications that need to allocate both small and large memory blocks. As a result, memory is wasted. [0003] In general, there are different ways to deal with this problem of memory allocation. One method is called "First Fit". This method is fast, but wastes memory. One example is to allocate a segment of memory whose size is the value that is closest to and greater than 2 times the requested size. For ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F12/02
CPCG06F12/023G06F12/02G06F12/06
Inventor 伊万·布勒皮埃尔·勒贝
Owner JALUNA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com