View in EDS PDF Full Text

Efficient Memory Allocator with Better Performance and Less Memory Usage.

Saved in:
Bibliographic Details
Title: Efficient Memory Allocator with Better Performance and Less Memory Usage.
Authors: Xiuhong Li1 lixiuhong2016@163.com, Gulila, Altenbek.1 gla@xju.edu.cn
Source: IAENG International Journal of Computer Science. Feb2018, Vol. 45 Issue 1, p152-158. 7p.
Subjects: Virtual storage (Computer science), Storage fragmentation (Computer science), Programmable controllers, Computer programmers, Loops (Group theory)
Abstract: Dynamic memory allocator is critical for native (C and C++) programs (malloc and free for C; new and delete for C++). Current memory allocator adopts a common design that organizes memory into several bins of fixed sizes to achieve fast memory allocation and de-allocation. This paper shows that this design would essentially introduce large ratio of memory fragmentation and thus lead to memory waste and degraded performance, especially for allocation intensive applications. To address this problem, we introduce a dynamic strategy to create customized bins of special sizes. Unlike the standard bins in previous general memory allocators, the customized bins created in our memory allocator can better fit allocations of special sizes and reduce memory fragmentation and usage, thus improve performance and space efficiency. Experimental results show that our new memory allocator can achieve up to 1.7x speedup (averagely over 18.8%) over the state-of-the-art memory allocator Hoard with 22% less memory usage. [ABSTRACT FROM AUTHOR]
Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 128228816
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Efficient Memory Allocator with Better Performance and Less Memory Usage.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Xiuhong+Li%22">Xiuhong Li</searchLink><relatesTo>1</relatesTo><i> lixiuhong2016@163.com</i><br /><searchLink fieldCode="AR" term="%22Gulila%2C+Altenbek%2E%22">Gulila, Altenbek.</searchLink><relatesTo>1</relatesTo><i> gla@xju.edu.cn</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IAENG+International+Journal+of+Computer+Science%22">IAENG International Journal of Computer Science</searchLink>. Feb2018, Vol. 45 Issue 1, p152-158. 7p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Virtual+storage+%28Computer+science%29%22">Virtual storage (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Storage+fragmentation+%28Computer+science%29%22">Storage fragmentation (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Programmable+controllers%22">Programmable controllers</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programmers%22">Computer programmers</searchLink><br /><searchLink fieldCode="DE" term="%22Loops+%28Group+theory%29%22">Loops (Group theory)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Dynamic memory allocator is critical for native (C and C++) programs (malloc and free for C; new and delete for C++). Current memory allocator adopts a common design that organizes memory into several bins of fixed sizes to achieve fast memory allocation and de-allocation. This paper shows that this design would essentially introduce large ratio of memory fragmentation and thus lead to memory waste and degraded performance, especially for allocation intensive applications. To address this problem, we introduce a dynamic strategy to create customized bins of special sizes. Unlike the standard bins in previous general memory allocators, the customized bins created in our memory allocator can better fit allocations of special sizes and reduce memory fragmentation and usage, thus improve performance and space efficiency. Experimental results show that our new memory allocator can achieve up to 1.7x speedup (averagely over 18.8%) over the state-of-the-art memory allocator Hoard with 22% less memory usage. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=128228816
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 7
        StartPage: 152
    Subjects:
      – SubjectFull: Virtual storage (Computer science)
        Type: general
      – SubjectFull: Storage fragmentation (Computer science)
        Type: general
      – SubjectFull: Programmable controllers
        Type: general
      – SubjectFull: Computer programmers
        Type: general
      – SubjectFull: Loops (Group theory)
        Type: general
    Titles:
      – TitleFull: Efficient Memory Allocator with Better Performance and Less Memory Usage.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Xiuhong Li
      – PersonEntity:
          Name:
            NameFull: Gulila, Altenbek.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 1819656X
          Numbering:
            – Type: volume
              Value: 45
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: IAENG International Journal of Computer Science
              Type: main
ResultId 1