This module presents the Sieve of Eratosthenes, a method for finding the prime numbers below a certain integer. One can model the sieve for small integers by hand. For bigger integers, it becomes necessary to use a coded implementation. This code can be either serial (sequential) or parallel. Students will explore the various forms of parallelism (shared memory, distributed memory, and hybrid) as well as the scaling of the algorithm on multiple cores in its various forms, observing the relationship between run time of the program and number of cores devoted to the program. An assessment rubric, two exercises, and two student project ideas allow the student to consolidate her/his understanding of the material presented in the module.


  • 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,Undergraduate (Lower Division),Graduate/Professional,NSDL_SetSpec_ncs-NSDL-COLLECTION-000-003-112-055,oai:nsdl.org:2200/20120503185435774T,Computer Science,Vocational/Professional Development Education,Mathematics,Education,General Public,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