Optimizing explicit data transfers for data parallel applications on the cell architecture

  • Authors:
  • Selma Saidi;Pranav Tendulkar;Thierry Lepley;Oded Maler

  • Affiliations:
  • Verimag Lab, University of Grenoble and STMicroelectronics Grenoble, France;Verimag Lab, University of Grenoble, France;STMicroelectronics Grenoble, France;CNRS-Verimag Lab, Grenoble, France

  • Venue:
  • ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we investigate a general approach to automate some deployment decisions for a certain class of applications on multi-core computers. We consider data-parallelizable programs that use the well-known double buffering technique to bring the data from the off-chip slow memory to the local memory of the cores via a DMA (direct memory access) mechanism. Based on the computation time and size of elementary data items as well as DMA characteristics, we derive optimal and near optimal values for the number of blocks that should be clustered in a single DMA command. We then extend the results to the case where a computation for one data item needs some data in its neighborhood. In this setting we characterize the performance of several alternative mechanisms for data sharing. Our models are validated experimentally using a cycle-accurate simulator of the Cell Broadband Engine architecture.