Parallel Computing in the Computer Science Curriculum > Modules

Modules

Want to know more about modules?

Find out more about modules and their contents.

Have a module of your own?

Contribute to the site by submitting your own module. Your submission will be reviewed by CS In Parallel to determine what categories it should be listed under. After that process, it will become available to all viewers of this site.

The Module Collection



Help

Show all pages

Current Search Limits

Possible Course Use

showing only Second CS major course Show all Possible Course Use

Results 1 - 9 of 9 matches

Concurrent Access to Data Structures
Professor Libby Shoop, Macalester College
This module enables students to experiment with creating a task-parallel solution to the problem of crawling the web by using Java threads and thread-safe data structures available in the java.util.concurrent package.

Multicore Programming with OpenMP
Richard Brown; Elizabeth Shoop
In this lab, we will create a program that intentionally uses multi-core parallelism, upload and run it on the MTL, and explore the issues in parallelism and concurrency that arise. This module uses OpenMP.

Map-reduce Computing for Introductory Students using WebMapReduce
Professor Richard Brown, St. Olaf College Professor Libby Shoop, Macalester College
This module emphasizes data-parallel problems and solutions, the so-called 'embarrassingly parallel' problems where processing of input data can easily be split among several parallel processes. Students use a web application called WebMapReduce (WMR) to write map and reduce functions that operate on portions of a massive dataset in parallel.

Concurrent Access to Data Structures in C++
Richard Brown
This module enables students to experiment with creating a task-parallel solution to the problem of crawling the web by using C++ with Boost threads and thread-safe data structures available in the Intel Threading ...

Patternlets in Parallel Programming
Material originally created by Joel Adams, Calvin CollegeCompiled by Libby Shoop, Macalester College
Short, simple C programming examples of basic shared memory programming patterns using OpneMP and basic message-passing patterns using MPI.

Visualize Numerical Integration
Elizabeth Shoop
This is an activity with working code supplied that enables students to see how various forms of the data decomposition pattern map processing units to computations.

Timing Operations in CUDA
Joel Adams, Calvin College, and Jeffrey Lyman, Macalester College
Through completion of Vector Addition, multipliction, square root, and squaring programs, students will gain an understanding of when the overhead of creating threads and copying memory is worth the speedup of GPU coding.

WMR Exemplar: UK Traffic Incidents
Elizabeth Shoop
Using data published by the United Kingdom department of Transportation about traffic incidents, students can explore and perform analyses using map-reduce techniques.

WMR Exemplar: LastFM million-song dataset
Elizabeth Shoop
This module demonstrates how hadoop and WMR can be used to analyze the lastFM million song dataset. It incorporates several advanced hadoop techniques such as job chaining and multiple input.



      Next Page »