检索结果-内蒙古大学图书馆

VCMalloc: A Virtually Contiguous memory allocator

IEEE TRANSACTIONS ON COMPUTERS 2023年第12期72卷 3431-3442页

作者： Hadjadj, Yacine Zouaoui, Chakib Mustapha Anouar Taleb, Nasreddine Mazari, Sarah El Bahri, Mohamed El Mezouar, Miloud Chikr Univ Djillali Liabes Sidi Bel Abbes RCAM Lab Sidi Bel Abbes 22000 Algeria

This paper presents VCMalloc, a custom memory allocator based on a new dynamic memory management approach that keeps data allocated in a contiguous form in memory. It can preserve the virtual contiguity of data even after performing different memory operations like "Reallocation" and "Free" without consuming much system resources. A novel control plane that we call a "memory Management System" is introduced with a set of algorithms for the physical-virtual memory mappings, assuring fast, efficient, and safe tracking of data and user pointers. The proposed allocator prioritizes virtual contiguity while it keeps the physical memory completely up to the operating system to manage. It was tested and compared with the current implementation of Malloc as well as a state-of-the-art memory allocator MIMalloc in the recent versions of the Microsoft Windows operating system. For the allocator itself, a considerable performance increase has been achieved in basic operations of up to 28% increase in allocation speed and 26% in reallocation speed. The data structures allocated by VCMalloc have shown remarkable performance increases of up to 31% faster for matrix multiplication. Furthermore, VCMalloc has also demonstrated its superiority in real-world SPEC CPU 2017 benchmark applications.

关键词： Contiguous memory memory allocator paging cache awareness data structures

来源：评论

学校读者我要写书评

暂无评论

The intelligent memory allocator selector

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2015年 44卷 342-354页

作者： Ulgen, Onur Avci, Mutlu Cukurova Univ Fac Engn & Architecture Dept Comp Engn Adana Turkey Cukurova Univ Fac Engn & Architecture Dept Biomed Engn Adana Turkey

memory fragmentation is a serious obstacle preventing efficient memory usage. Garbage collectors may solve the problem;however, they cause serious performance impact, memory and energy consumption. Therefore, various memory allocators have been developed. Software developers must test memory allocators, and find an efficient one for their programs. Instead of this cumbersome method, we propose a novel approach for dynamically deciding the best memory allocator for every application. The proposed solution tests each process with various memory allocators. After the testing, it selects an efficient memory allocator according to condition of operating system (OS). If OS runs out of memory, then it selects the most memory efficient allocator for new processes. If most of the CPU power was occupied, then it selects the fastest allocator. Otherwise, the balanced allocator is selected. According to test results, the proposed solution offers up to 58% less fragmented memory, and 90% faster memory operations. In average of 107 processes, it offers 7.16 +/- 2.53% less fragmented memory, and 1.79 +/- 7.32% faster memory operations. The test results also prove the proposed approach is unbeatable by any memory allocator. In conclusion, the proposed method is a dynamic and efficient solution to the memory fragmentation problem. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： memory fragmentation memory allocator Garbage collection Virtual machine

来源：评论

学校读者我要写书评

暂无评论

A Case Study of a DRAM-NVM Hybrid memory allocator for Key-Value Stores

IEEE COMPUTER ARCHITECTURE LETTERS

引用

IEEE COMPUTER ARCHITECTURE LETTERS 2022年第2期21卷 81-84页

作者： Kim, Minjae Kim, Bryan S. Lee, Eunji Lee, Sungjin DGIST Dept Elect Engn & Comp Sci Daegu 42998 South Korea Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA Soongsil Univ Dept Smart Syst Software Seoul 06978 South Korea

As non-volatile memory (NVM) technologies advance, commercial NVDIMM devices have been made readily available for various computing systems. To efficiently utilize the high-density and high-capacity of NVM, the latest Xeon CPUs support a special memory Modethat turns the DRAM into a last-level (L4) cache and uses NVM as the user-addressable system memory. Unfortunately, memory Mode often provides low performance, even slower than when only NVM is used without any DRAM cache. According to our analysis, this is due to the inefficient management of a DRAM cache by the integrated memory controller, which results in high miss rates. This paper proposes a new hybrid memory allocator, called TARMAC. By employing intelligent yet lightweight memory management policies at the memory allocator level, TARMAC manages two different types of memory devices more efficiently, achieving 37% higher cache hit rate, 67% higher throughput, and 40% shorter memory latency than the hardware-based memory Mode, on average. TARMAC exposes memory interfaces compatible with traditional memory allocators, enabling existing software to use TARMAC without any manual modification.

关键词： Random access memory Nonvolatile memory memory management Throughput Performance evaluation Data models Analytical models Non-volatile memory memory performance analysis memory allocator

来源：评论

学校读者我要写书评

暂无评论

Redesign the memory allocator for Non-Volatile Main memory

引用

ACM JOURNAL ON EMERGING TECHNOLOGIES IN COMPUTING SYSTEMS 2017年第3期13卷 1–26页

作者： Yu, Songping Xiao, Nong Deng, Mingzhu Liu, Fang Chen, Wei Natl Univ Def Technol State Key Lab High Performance Comp Coll Comp Changsha Hunan Peoples R China

The non-volatile memory (NVM) has the merits of byte-addressability, fast speed, persistency and low power consumption, which make it attractive to be used as main memory. Commonly, user process dynamically acquires memory through memory allocators. However, traditional memory allocators designed with in-place data writes are not appropriate for the non-volatile main memory (NVRAM) due to the limited endurance. In this article, first, we quantitatively analyze the wear-oblivious of DRAM-oriented designed allocator-glibc malloc and the inefficiency of wear-conscious allocator NVMalloc. Then, we propose WAlloc, an efficient wear-aware manual memory allocator designed for NVRAM: (1) decouples metadata and data management;(2) distinguishes metadata with volatility;(3) redirects the data writes around to achieve wear-leveling;(4) redesigns an efficient and effective NVM copy mechanism, bypassing the CPU cache partially and prefetching data explicitly. Finally, experimental results show that the wear-leveling of WAlloc outperforms that of NVMalloc about 30% and 60% under random workloads and well-distributed workloads, respectively. Besides, WAlloc reduces the average data memory writes in 64 bytes block by 1.5 times comparing with glibc malloc. With the fulfillment of data persistency, cache bypassing NVM copy is better than cache line flushing NVM copy with performance improvement circa 14%.

关键词： Non-volatile memory memory allocator wear-aware virtual memory

来源：评论

学校读者我要写书评

暂无评论

A Wear Leveling Aware memory allocator for Both Stack and Heap Management in PCM-based Main memory Systems 22

A Wear Leveling Aware Memory Allocator for Both Stack and He...

引用

22nd Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Li, Wei Shuai, Ziqi Xue, Chun Jason Yuan, Mengting Li, Qingan Wuhan Univ Sch Comp Sci Wuhan Hubei Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9783981926323

Phase change memory (PCM) has been considered as a replacement of DRAM, due to its potentials in high storage density and low leakage power. However, the limited write endurance presents critical challenges. Various wear leveling techniques have been proposed to mitigate this issue from different perspectives, including both hardware and software levels. This paper proposes a wear leveling aware memory allocator, which (1) always prefers allocating memory blocks with less writes upon memory requests, and (2) leaves blocks allocated more than a threshold value unallocable temporarily. Furthermore, for the first time, this allocator provides a uniform management scheme for both stack and heap areas, thus could better balance writes in stack and heap areas. Experimental evaluations show that, compared to state-of-the-art memory allocators (i.e., glibc malloc, NVMalloc and Walloc), the proposed memory allocator improves the PCM wear leveling, in terms of CoV (a wear leveling indicator) by 41.9%, 30.3%, and 35.8%, respectively.

关键词： PCM wear leveling memory allocator stack and heap

来源：评论

学校读者我要写书评

暂无评论

Megalloc*: Fast Distributed memory allocator for NVM-based Cluster

Megalloc*: Fast Distributed Memory Allocator for NVM-based C...

引用

12th International Conference on Networking, Architecture, and Storage (NAS)

作者： Yu, Songping Xiao, Nong Deng, Mingzhu Xing, Yuxuan Liu, Fang Chen, Wei Natl Univ Def Technol State Key Lab High Performance Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781538634868

As the expected emerging Non-Volatile memory (NVM) technologies, such as 3DXPoint, are in production, there has been a recent push in the big data processing community from storage-centric towards memory-centric. Generally, in large-scale systems, distributed memory management through traditional network with TCP/IP protocol exposes performance bottleneck. Briefly, CPU-centric network involves context switching, memory copy etc. Remote Direct memory Access (RDMA) technology reveals the tremendous performance advantage over than TCP/IP: Allowing access to remote memory directly bypassing OS kernel. In this paper, we propose Megalloc, a distributed NVM allocator exposes NVMs as a shared address space of a cluster of machines based-on RDMA. Firstly, it makes memory allocation metadata accessed directly by each machine, allocating NVM in coarse-grained way;secondly, adopting fine-grained memory chunk for applications to read or store data;finally, it guarantees high distributed memory allocation performance.

关键词： distributed memory memory allocator RDMA Non-Volatile memory

来源：评论

学校读者我要写书评

暂无评论

MCMalloc: A Scalable memory allocator for Multithreaded Applications on a Many-Core Shared-memory Machine 5

MCMalloc: A Scalable Memory Allocator for Multithreaded Appl...

引用

IEEE International Conference on Big Data (IEEE Big Data)

作者： Umayabara, Akira Yamana, Hayato Waseda Univ Tokyo Japan

ISBN: (纸本)9781538627150

In the big data era, multithreaded processing on a many-core machine, whose core number is still increasing, has become essential to parallelize the execution of big data applications, besides distributed computing. In such a machine, malloc-intensive applications cannot scale due to lock contentions among threads, which becomes worse as the number of threads increases. To solve the problem, we propose a new method to reduce lock contentions by batch malloc, pseudo free, and fine-grained data-locking. Experimental result shows 4.72 times speed-up in comparison with JEmalloc which is the fastest memory allocator among previous ones.

关键词： component memory allocator many-core

来源：评论

学校读者我要写书评

暂无评论

HMalloc: A Hybrid, Scalable, and Lock-free memory allocator for Multi-threaded Applications 25

HMalloc: A Hybrid, Scalable, and Lock-free Memory Allocator ...

引用

25th IEEE International Conference on Parallel and Distributed Systems (IEEE ICPADS)

作者： Li, Tianlin Yao, Yiping Tang, Wenjie Lin, Zhongwei Natl Univ Def Technol Changsha Peoples R China Natl Univ Def Technol Hefei Peoples R China

ISBN: (纸本)9781728125831

An efficient multi-threaded memory allocator has great impact on performance of applications with frequent memory allocation and deallocation operations. Currently, most popular memory allocators ignore the difference between thread local and shared memory, and manage them in a unified manner, which cannot make good use of the spatiotemporal locality of memory access. To solve this problem, this paper proposes a hybrid and lock-free multi-threaded memory allocator, named HMalloc. The allocator separates local memory from shared memory. There is no false sharing and lock contentions in local memory allocation and deallocation process. Moreover, coalescence-free is used to optimize this process. Further, a flag-based shared memory allocation and deallocation method is proposed to achieve lock-free shared memory management. Experimental results show that HMalloc can achieve significant performance improvement when compared with existing well-known memory allocators.

关键词： hybrid lock-free scalable multi-threaded memory allocator

来源：评论

学校读者我要写书评

暂无评论

PMA: A Persistent memory allocator with High Efficiency and Crash Consistency Guarantee 41

PMA: A Persistent Memory Allocator with High Efficiency and ...

引用

41st IEEE International Conference on Computer Design (ICCD)

作者： Xiang, Xiangyu Hua, Yu Xu, Hao Huazhong Univ Sci & Technol WNLO Wuhan Hubei Peoples R China

ISBN: (纸本)9798350342918

Byte-addressable persistent memory (PM) exhibits salient features of low latency and high capacity. PM can be memory-mapped to the virtual address space of a process and be directly accessed via load and store instructions. Persistent memory allocator is a fundamental building block in PM-oriented programs, which provides dynamic memory allocation/deallocation primitives for developers to efficiently and safely leverage the PM. Different from DRAM allocators, a PM allocator needs to guarantee the integrity and consistency of metadata in the face of a crash. To this end, we propose a high-efficiency PM allocator, called PMA, with crash consistency guarantee. PMA uses a two-level memory management strategy and sets up a private memory pool for each thread to achieve low fragmentation and high concurrency. Furthermore, PMA employs per-thread write-ahead undo log to protect the integrity and consistency of metadata against crashes. PMA also designs a lightweight persistent pointer to reference an allocated persistent memory object across runtimes. PMA is implemented as an easy-to-use library that is independent of specific PM platforms. Extensive evaluation results on a real PM platform demonstrate the efficiency and efficacy of our proposed PMA, compared with state-of-the-art log-based PM allocators.

关键词： Persistent memory memory Management memory allocator Crash Consistency

来源：评论

学校读者我要写书评

暂无评论

Metall: A persistent memory allocator for data-centric analytics

引用

PARALLEL COMPUTING 2022年 111卷

作者： Iwabuchi, Keita Youssef, Karim Velusamy, Kaushik Gokhale, Maya Pearce, Roger Lawrence Livermore Natl Lab Ctr Appl Sci Comp 7000 East Ave Livermore CA 94550 USA Virginia Polytech Inst & State Univ Dept Comp Sci Blacksburg VA 24061 USA Univ Maryland Dept Comp Sci 1000 Hilltop Cir Baltimore MD 21250 USA

Data analytics applications transform raw input data into analytics-specific data structures before performing analytics. Unfortunately, such data ingestion steps are often more expensive than analytics. In addition, various types of NVRAM devices are already used in many HPC systems today. Such devices will be useful for storing and reusing data structures beyond a single process life cycle. We developed Metall, a persistent memory allocator built on top of the memory-mapped file mechanism. Metall enables applications to transparently allocate custom C++ data structures into various types of persistent memories. Metall incorporates a concise and high-performance memory management algorithm inspired by Supermalloc and the rich C++ interface developed by *** library. On a dynamic graph construction workload, Metall achieved up to 11.7x and 48.3x performance improvements over *** and memkind (PMEM kind), respectively. We also demonstrate Metall's high adaptability by integrating Metall into a graph processing framework, GraphBLAS Template Library. This study's outcomes indicate that Metall will be a strong tool for accelerating future large-scale data analytics by allowing applications to leverage persistent memory efficiently.

关键词： Persistent memory memory allocator Graph processing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：