Publications
Detailed Information
GCMA: Guaranteed contiguous memory allocator
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, SeongJae | - |
dc.contributor.author | Kim, Minchan | - |
dc.contributor.author | Yeom, Heonyoung | - |
dc.date.accessioned | 2022-05-16T05:42:51Z | - |
dc.date.available | 2022-05-16T05:42:51Z | - |
dc.date.created | 2020-01-23 | - |
dc.date.created | 2020-01-23 | - |
dc.date.created | 2020-01-23 | - |
dc.date.issued | 2019-03 | - |
dc.identifier.citation | IEEE Transactions on Computers, Vol.68 No.3, pp.390-401 | - |
dc.identifier.issn | 0018-9340 | - |
dc.identifier.uri | https://hdl.handle.net/10371/179666 | - |
dc.description.abstract | The importance of physically contiguous memory has increased in modern computing environments, including both low- and high-end systems. Existing physically contiguous memory allocators generally have critical limitations. For example, the most commonly adopted solution, the memory reservation technique, wastes a significant amount of memory space. Scatter/Gather direct memory access (DMA) and input-output memory management units (IOMMUs) avoid this problem by utilizing additional hardware for address space virtualization. However, additional hardware means an increase in costs and power consumption, which is especially disadvantageous for small systems and they do not provide real contiguous memory. Linux Contiguous Memory Allocator (CMA) aims to provide both contiguous memory allocation and to maximize memory utilization based on page migration, but they suffer from unpredictably long latency and a high probability of allocation failure. Therefore, we introduce a new solution to this problem, the guaranteed contiguous memory allocator (GCMA). This guarantees efficient memory space utilization, short latency, and successful allocation. The GCMA uses a reservation scheme and increases memory utilization by sharing the memory with immediately discardable data. Our evaluation of a GCMA on a Raspberry Pi 2 finds a latency that is 15-130 times lower compared to a CMA, and a latency that is up to 10 times lower when taking a photo. Using a large working set in a memory-fragmented high-end system, the GCMA is able to produce a 2.27x speedup. | - |
dc.language | 영어 | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.title | GCMA: Guaranteed contiguous memory allocator | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/TC.2018.2869169 | - |
dc.citation.journaltitle | IEEE Transactions on Computers | - |
dc.identifier.wosid | 000458761500006 | - |
dc.identifier.scopusid | 2-s2.0-85059111358 | - |
dc.citation.endpage | 401 | - |
dc.citation.number | 3 | - |
dc.citation.startpage | 390 | - |
dc.citation.volume | 68 | - |
dc.description.isOpenAccess | N | - |
dc.contributor.affiliatedAuthor | Yeom, Heonyoung | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.subject.keywordAuthor | Memory management | - |
dc.subject.keywordAuthor | operating systems | - |
dc.subject.keywordAuthor | real-time and embedded systems | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.