Abstract
Modern supercomputer architectures offer ever more power, but rely heavily on a hierarchical organization of resources.While internode communication can easily be handled by MPI, efficient usage of multi-core CPUs requires the programmer to parallelize a given problem using shared-memory programming models. Hybrid approaches to high scalability become ever more popular and are frequently very successful. Here, we will look at scheduling overheads of three different models. Hybrid approaches to high scalability become ever more popular and are frequently very successful.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nachtmann, M., Gracia, J., Glass, C.W. (2013). Scheduling Overheads for Task-Based Parallel Programming Models. In: Keller, R., Kramer, D., Weiss, JP. (eds) Facing the Multicore-Challenge III. Lecture Notes in Computer Science, vol 7686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35893-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-35893-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35892-0
Online ISBN: 978-3-642-35893-7
eBook Packages: Computer ScienceComputer Science (R0)