Scheduling Overheads for Task-Based Parallel Programming Models

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.