%0 Conference Paper %1 6008969 %A Serres, O. %A Anbar, A. %A Merchant, S.G. %A Kayi, A. %A El-Ghazawi, T. %B Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on %D 2011 %K PGAS UPC compiler optimization %P 1191--1198 %R 10.1109/IPDPS.2011.279 %T Address Translation Optimization for Unified Parallel C Multi-dimensional Arrays %U http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6008969&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6008969 %X Partitioned Global Address Space (PGAS) languages offer significant programmability advantages with its global memory view abstraction, one-sided communication constructs and data locality awareness. These attributes place PGAS languages at the forefront of possible solutions to the exploding programming complexity in the many-core architectures. To enable the shared address space abstraction, PGAS languages use an address translation mechanism while accessing shared memory to convert shared addresses to physical addresses. This mechanism is already expensive in terms of performance in distributed memory environments, but it becomes a major bottleneck in machines with shared memory support where the access latencies are significantly lower. Multi- and many-core processors exhibit even lower latencies for shared data due to on-chip cache space utilization. Thus, efficient handling of address translation becomes even more crucial as this overhead may easily become the dominant factor in the overall data access time for such architectures. To alleviate address translation overhead, this paper introduces a new mechanism targeting multi-dimensional arrays used in most scientific and image processing applications. Relative costs and the implementation details for UPC are evaluated with different workloads (matrix multiplication, Random Access benchmark and Sobel edge detection) on two different platforms: a many-core system, the TILE64 (a 64 core processor) and a dual-socket, quad-core Intel Nehalem system (up to 16 threads). Our optimization provides substantial performance improvements, up to 40x. In addition, the proposed mechanism can easily be integrated into compilers abstracting it from the programmers. Accordingly, this improves UPC productivity as it will reduce manual optimization efforts required to minimize the address translation overhead.

@inproceedings{6008969, abstract = {Partitioned Global Address Space (PGAS) languages offer significant programmability advantages with its global memory view abstraction, one-sided communication constructs and data locality awareness. These attributes place PGAS languages at the forefront of possible solutions to the exploding programming complexity in the many-core architectures. To enable the shared address space abstraction, PGAS languages use an address translation mechanism while accessing shared memory to convert shared addresses to physical addresses. This mechanism is already expensive in terms of performance in distributed memory environments, but it becomes a major bottleneck in machines with shared memory support where the access latencies are significantly lower. Multi- and many-core processors exhibit even lower latencies for shared data due to on-chip cache space utilization. Thus, efficient handling of address translation becomes even more crucial as this overhead may easily become the dominant factor in the overall data access time for such architectures. To alleviate address translation overhead, this paper introduces a new mechanism targeting multi-dimensional arrays used in most scientific and image processing applications. Relative costs and the implementation details for UPC are evaluated with different workloads (matrix multiplication, Random Access benchmark and Sobel edge detection) on two different platforms: a many-core system, the TILE64 (a 64 core processor) and a dual-socket, quad-core Intel Nehalem system (up to 16 threads). Our optimization provides substantial performance improvements, up to 40x. In addition, the proposed mechanism can easily be integrated into compilers abstracting it from the programmers. Accordingly, this improves UPC productivity as it will reduce manual optimization efforts required to minimize the address translation overhead.}, added-at = {2012-09-13T22:00:21.000+0200}, author = {Serres, O. and Anbar, A. and Merchant, S.G. and Kayi, A. and El-Ghazawi, T.}, biburl = {https://www.bibsonomy.org/bibtex/25ed260b9f66221c78894532616b21e40/gron}, booktitle = {Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on}, description = {IEEE Xplore - Address Translation Optimization for Unified Parallel C Multi-dimensional Arrays}, doi = {10.1109/IPDPS.2011.279}, interhash = {fe8becbbf3020b7d44f9485af433bd25}, intrahash = {5ed260b9f66221c78894532616b21e40}, issn = {1530-2075}, keywords = {PGAS UPC compiler optimization}, month = may, pages = {1191--1198}, timestamp = {2012-09-13T22:00:21.000+0200}, title = {Address Translation Optimization for Unified Parallel C Multi-dimensional Arrays}, url = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6008969&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6008969}, year = 2011 }