Achieving Memory Access Equalization Via Round-Trip Routing Latency Prediction in 3D Many-Core NoCs

Author(s):  
Xiaowen Chen ◽  
Zhonghai Lu ◽  
Yang Li ◽  
Axel Jantsch ◽  
Xueqian Zhao ◽  
...  
Keyword(s):  
2014 ◽  
Vol 11 (24) ◽  
pp. 20141027-20141027
Author(s):  
Yang Li ◽  
Xiaowen Chen ◽  
Xiaohui Zhao ◽  
Yong Yang ◽  
Hengzhu Liu
Keyword(s):  

Author(s):  
Chuan Tang ◽  
Dan Liu ◽  
Zuocheng Xing ◽  
Peng Yang ◽  
Zhe Wang ◽  
...  
Keyword(s):  

Author(s):  
Weiwei Fu ◽  
Mingmin Yuan ◽  
Tianzhou Chen ◽  
Li Liu
Keyword(s):  

The size of complex networks introduces large amounts of traversal times that can be tackled by exploiting pervasive multi-core and many-core parallel hardware architectures. However, there is a list of factors that make the design of efficient parallel traversal algorithms for graphs difficult: unstructured problems, data-driven computation, irregular memory access, poor locality, and low computing load. In this chapter, the authors introduce the synergy between Network Science and High Performance Computing and motivate the combined use of multi/many-core heterogeneous computing and Network Science techniques to tackle the above-mentioned challenges and to efficiently traverse the structure of massive real-world graphs.


2017 ◽  
Vol 16 (5s) ◽  
pp. 1-21 ◽  
Author(s):  
Xiaowen Chen ◽  
Zhonghai Lu ◽  
Sheng Liu ◽  
Shuming Chen
Keyword(s):  

2014 ◽  
Vol 30 ◽  
pp. 202-215 ◽  
Author(s):  
Lin Ma ◽  
Kunal Agrawal ◽  
Roger D. Chamberlain
Keyword(s):  

2014 ◽  
Vol 22 (3) ◽  
pp. 239-257 ◽  
Author(s):  
Jianbin Fang ◽  
Henk Sips ◽  
Ana Lucia Varbanescu

Due to the increasing complexity of multi/many-core architectures (with their mix of caches and scratch-pad memories) and applications (with different memory access patterns), the performance of many workloads becomes increasingly variable. In this work, we address one of the main causes for this performance variability: the efficiency of the memory system. Specifically, based on an empirical evaluation driven by memory access patterns, we qualify and partially quantify the performance impact of using local memory in multi/many-core processors. To do so, we systematically describe memory access patterns (MAPs) in an application-agnostic manner. Next, for each identified MAP, we use OpenCL (for portability reasons) to generate two microbenchmarks: a “naive” version (without local memory) and “an optimized” version (using local memory). We then evaluate both of them on typically used multi-core and many-core platforms, and we log their performance. What we eventually obtain is a local memory performance database, indexed by various MAPs and platforms. Further, we propose a set of composing rules for multiple MAPs. Thus, we can get an indicator of whether using local memory is beneficial in the presence of multiple memory access patterns. This indication can be used to either avoid the hassle of implementing optimizations with too little gain or, alternatively, give a rough prediction of the performance gain.


Sign in / Sign up

Export Citation Format

Share Document