This module teaches: 1) How to approximate the area under a curve using a Riemann sum, 2) how approximating the area under a curve is used in solutions to scientific problems, 3) how to implement parallel code for Area Under a Curve (including versions that use shared memory via OpenMP, distributed memory via the Message Passing Interface (MPI), and hybrid via a combination of MPI and OpenMP), 4) how to measure the performance and scaling of a parallel application in multicore and manycore environments, and 5) how Area Under a Curve falls into the MapReduce "dwarf" (a class of algorithms that have similar communication and computation patterns). Upon completion of this module, students should be able to: 1) Understand the importance of approximating the area under a curve in modeling scientific problems, 2) Design a parallel algorithm and implement it using MPI and/or OpenMP, 3) Measure the scalability of a parallel code over multiple or many cores, and 4) Explain the communication and computation patterns of the MapReduce dwarf. It is assumed that students will have prerequisite experience with C or Fortran 90, *nix systems, and modular arithmetic.


  • Computer Science > General
  • Education > General
  • Mathematics > General

Education Levels:

  • Grade 1
  • Grade 2
  • Grade 3
  • Grade 4
  • Grade 5
  • Grade 6
  • Grade 7
  • Grade 8
  • Grade 9
  • Grade 10
  • Grade 11
  • Grade 12


Informal Education,Higher Education,NSDL,Undergraduate (Upper Division),Computational Science,oai:nsdl.org:2200/20120110202842483T,Undergraduate (Lower Division),Graduate/Professional,NSDL_SetSpec_ncs-NSDL-COLLECTION-000-003-112-055,Computer Science,Vocational/Professional Development Education,Mathematics,Education,Computing and Information



Access Privileges:

Public - Available to anyone

License Deed:

Creative Commons Attribution Non-Commercial Share Alike


This resource has not yet been aligned.
Curriki Rating
'NR' - This resource has not been rated
'NR' - This resource has not been rated

This resource has not yet been reviewed.

Not Rated Yet.

Non-profit Tax ID # 203478467