Change search
ReferencesLink to record
Permanent link

Direct link
A Comparison of some recent Task-based Parallel Programming Models
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS. (Kista Multicore Center)
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS. (Kista Multicore Center)ORCID iD: 0000-0002-9637-2065
2010 (English)In: Proceedings of the 3rd Workshop on Programmability Issues for Multi-Core Computers, (MULTIPROG'2010), Jan 2010, Pisa, 2010Conference paper (Refereed)
Abstract [en]

The need for parallel programming models that are simple to use and at the same time efficient for current ant future parallel platforms has led to recent attention to task-based models such as Cilk++, Intel TBB and the task concept in OpenMP version 3.0. The choice of model and implementation can have a major impact on the final performance and in order to understand some of the trade-offs we have made a quantitative study comparing four implementations of OpenMP (gcc, Intel icc, Sun studio and the research compiler Mercurium/nanos mcc), Cilk++ and Wool, a high-performance task-based library developed at SICS. Abstract. We use microbenchmarks to characterize costs for task-creation and stealing and the Barcelona OpenMP Tasks Suite for characterizing application performance. By far Wool and Cilk++ have the lowest overhead in both spawning and stealing tasks. This is reflected in application performance when many tasks with small granularity are spawned where Cilk++ and, in particular, has the highest performance. For coarse granularity applications, the OpenMP implementations have quite similar performance as the more light-weight Cilk++ and Wool except for one application where mcc is superior thanks to a superior task scheduler. Abstract. The OpenMP implemenations are generally not yet ready for use when the task granularity becomes very small. There is no inherent reason for this, so we expect future implementations of OpenMP to focus on this issue.

Place, publisher, year, edition, pages
National Category
Computer Science
URN: urn:nbn:se:kth:diva-89616OAI: diva2:503167
MULTIPROG'2010, Jan 2010, Pisa
Qc 20120214Available from: 2012-02-15 Created: 2012-02-15 Last updated: 2012-02-15Bibliographically approved

Open Access in DiVA

Podobas-Multiprog'2010(258 kB)286 downloads
File information
File name FULLTEXT01.pdfFile size 258 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Conference website

Search in DiVA

By author/editor
Podobas, ArturBrorsson, Mats
By organisation
Software and Computer Systems, SCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 286 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 159 hits
ReferencesLink to record
Permanent link

Direct link