CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Efficient Forwarding of Producer-Consumer Data in Task-based Programs

Madhavan Manivannan (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Anurag Negi (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Per Stenström (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
Göteborg : Chalmers University of Technology, 2013. - 10 s.

Task-based programming models are increasingly being adopted due to their ability to express parallelism. They also lead to higher programmer productivity by delegating to the run-time system and the architecture demanding parallelism management tasks such as scheduling and staging of the communication between tasks. This paper focuses on techniques to optimize producer-consumer sharing in task-based programs. As the set of producer and consumer tasks can often be statically determined, coherence prediction techniques are expected to successfully optimize producer-consumer sharing. We show that they are ineffective because the mapping of tasks to cores changes based on runtime conditions. The paper contributes with a technique that forwards produced and spatially close blocks to the consumer in a single transaction when a consumer requests a first block. We also find that stride prefetching is competitive with our forwarding technique for sufficiently coarse tasks. However, its effectiveness deteriorates as the task granularity is reduced because of limited opportunities to train for the access pattern and to issue prefetches sufficiently ahead of time. This makes our forwarding scheme a robust alternative to reduce communication overhead in task-based programs.

Nyckelord: producer-consumer sharing, task parallelism, data forwarding, prefetching

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-11-11. Senast ändrad 2013-11-19.
CPL Pubid: 186430