]]>
]]>
title錛歁MT: Exploiting Fine-Grained Parallelism in Dynamic Memory Management
Abstract鈥擠ynamic memory management is one of the most
expensive but ubiquitous operations in many C/C++ applications.
Additional features such as security checks, while desirable,
further worsen memory management overheads. With
advent of multicore architecture, it is important to investigate
how dynamic memory management overheads for sequential
applications can be reduced.
In this paper, we propose a new approach for accelerating
dynamic memory management on multicore architecture, by
offloading dynamic management functions to a separate thread
that we refer to as memory management thread (MMT).
We show that an efficient MMT design can give significant
performance improvement by extracting parallelism while being
agnostic to the underlying memory management library
algorithms and data structures. We also show how parallelism
provided by MMT can be beneficial for high overhead memory
management tasks, for example, security checks related to
memory management.
We evaluate MMT on heap allocation-intensive benchmarks
running on an Intel core 2 quad platform for two widelyused
memory allocators: Doug Lea’s and PHKmalloc allocators.
On average, MMT achieves a speedup ratio of 1.19×
for both allocators, while both the application and memory
management libraries are unmodified and are oblivious to the
parallelization scheme. For PHKmalloc with security checks
turned on, MMT reduces the security check overheads from
21% to only 1% on average.
]]>
榪欏氨鏄紶璇翠腑鐨勫唴瀛樻尟鑽″拰鍐呭瓨紕庣墖銆傘傘?
涓婇潰鐨勫唴瀛樼鐞嗭紝鏄幇鍦ㄦ櫘閬嶉噰鐢ㄧ殑鏂規硶涓殑鍏朵腑涓縐嶏紝騫墮潪鏂伴矞浜嬨?濡傛灉浣犺寰楀ぇ瀹朵笉鐢╪ew delete鏄棤鑱娿傞偅浣犲彲浠ュ啓綃囪創瀛愭潵鍠楓?浣嗘槸濡傛灉浣犳槸鍦ㄨ嚜宸辨病鏈夊畬鍏ㄧ悊瑙ｇ殑鎯呭喌涓嬭榪欐牱鐨勮瘽錛岄偅鎴戜細寰堟湁鎰忚銆?鏈変簺涓滆タ錛屼笉鑳介潬鑷繁鐚滐紝鐗瑰埆鏄疌/C++銆?
鎴戜笉鐭ラ亾浣犳槸涓嶆槸鎯寵榪欎釜絳旀銆傛垨璁革紝浣犳寚鐨勬槸鍒牱錛侊紒錛?img src ="http://m.shnenglu.com/HoneyCat/aggbug/115055.html" width = "1" height = "1" />
]]>
]]>
]]>