Memory Space Recycling

Author:

Ryoo Jihyun1,Kandemir Mahmut Taylan1,Karakoy Mustafa2

Affiliation:

1. The Pennsylvania State University, State College, PA, USA

2. TUBITAK-BILGEM, Gebze, Turkey

Abstract

Many program codes from different application domains process very large amounts of data, making their cache memory behavior critical for high performance. Most of the existing work targeting cache memory hierarchies focus on improving data access patterns, e.g., maximizing sequential accesses to program data structures via code and/or data layout restructuring strategies. Prior work has addressed this data locality optimization problem in the context of both single-core and multi-core systems. Another dimension of optimization, which can be as equally important/beneficial as improving data access pattern is to reduce the data volume (total number of addresses) accessed by the program code. Compared to data access pattern restructuring, this volume minimization problem has relatively taken much less attention. In this work, we focus on this volume minimization problem and address it in both single-core and multi-core execution scenarios. Specifically, we explore the idea of rewriting an application program code to reduce its "memory space footprint". The main idea behind this approach is to reuse/recycle, for a given data element, a memory location that has originally been assigned to another data element, provided that the lifetimes of these two data elements do not overlap with each other. A unique aspect is that it is "distance aware", i.e., in identifying the memory/cache locations to recycle it takes into account the physical distance between the location of the core and the memory/cache location to be recycled. We present a detailed experimental evaluation of our proposed memory space recycling strategy, using five different metrics: memory space consumption, network footprint, data access distance, cache miss rate, and execution time. The experimental results show that our proposed approach brings, respectively, 33.2%, 48.6%, 46.5%, 31.8%, and 27.9% average improvements in these metrics, in the case of single-threaded applications. With the multi-threaded versions of the same applications, the achieved improvements are 39.5%, 55.5%, 53.4%, 26.2%, and 22.2%, in the same order.

Funder

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Hardware and Architecture,Safety, Risk, Reliability and Quality,Computer Science (miscellaneous)

Reference48 articles.

1. Kristof E. Beyls and Erik H . D'Hollander . 2000 . Compiler generated multithreading to alleviate memory latency. Universal Computer Science, special issue on Multithreaded Processors and Chip-Multiprocessors , Vol. 6 , 10 (2000), 968-993. Kristof E. Beyls and Erik H. D'Hollander. 2000. Compiler generated multithreading to alleviate memory latency. Universal Computer Science, special issue on Multithreaded Processors and Chip-Multiprocessors , Vol. 6, 10 (2000), 968-993.

2. Christian Bienia . 2011. Benchmarking Modern Multiprocessors. Ph.,D. Dissertation . Princeton University . Christian Bienia. 2011. Benchmarking Modern Multiprocessors. Ph.,D. Dissertation. Princeton University.

3. The PARSEC benchmark suite

4. Jim Butterfield. 1986. Part 4: Overlaying. In Loading and Linking Commodore Programs. Compute! Jim Butterfield. 1986. Part 4: Overlaying. In Loading and Linking Commodore Programs. Compute!

5. Compiler optimizations for improving data locality

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3