Open Access
Article

International Journal of Parallel Programming

, Volume 41, Issue 3, pp 400-429

Addressing GPU On-Chip Shared Memory Bank Conflicts Using Elastic Pipeline

Authors

  • Chunyang Gou
    • Computer Engineering Laboratory, Faculty of Electrical EngineeringMathematics and Computer Science TU Delft
  • Georgi N. Gaydadjiev
    • Computer Engineering Laboratory, Faculty of Electrical EngineeringMathematics and Computer Science TU Delft

DOI: 10.1007/s10766-012-0201-1

Abstract

One of the major problems with the GPU on-chip shared memory is bank conflicts. We analyze that the throughput of the GPU processor core is often constrained neither by the shared memory bandwidth, nor by the shared memory latency (as long as it stays constant), but is rather due to the varied latencies caused by memory bank conflicts. This results in conflicts at the writeback stage of the in-order pipeline and causes pipeline stalls, thus degrading system throughput. Based on this observation, we investigate and propose a novel Elastic Pipeline design that minimizes the negative impact of on-chip memory bank conflicts on system throughput, by decoupling bank conflicts from pipeline stalls. Simulation results show that our proposed Elastic Pipeline together with the co-designed bank-conflict aware warp scheduling reduces the pipeline stalls by up to 64.0 % (with 42.3 % on average) and improves the overall performance by up to 20.7 % (on average 13.3 %) for representative benchmarks, at trivial hardware overhead.

Keywords

GPU On-chip shared memory Bank conflicts Elastic pipeline

Acknowledgments

This work was supported by the European Commission in the context of the SARC project (FP6 FET Contract #27648) and was continued by the ENCORE project (FP7 ICT4 Contract #249059). We would also like to thank the reviewers for their insightful comments.

Open Access

This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.

Copyright information

© The Author(s) 2012