Courseware - Discrete Structures (DS)

SIGCSE2012 Workshop 23 Parallelism and Concurrency for Data-Structures & Algorithms courses

Material Type:

Lecture / Presentation, Coding example

ISN Logo

Technical Format:

zip archive, .pptx


Go to URL


Go to materials

Date Added:


Date Modified:



Johnnie Baker, Kent State University
Robert Chesebrough, Intel
Oberta Slotterbeck, Hiram College

This workshop is inspired by Dan Grossman’s SIGCSE 2011 workshop on Data Abstractions. We review C/C++ conversions of the original Java-based materials and will include material from the Parallel Algorithms course at Kent State. The workshop will appeal to data-structure and algorithms course instructors. Workshop topics will include divide and conquer approaches, work sharing concepts, and a scoped locking scheme in OpenMP* for C++ classes. This material is driven via core data-structure examples (queues, sorting, reductions, etc.) and using a Fork/Join Framework found in OpenMP* and Intel® Cilk Plus and Intel® Threading Building Blocks. Participants will write parallel programs and test them on the Intel® Many-core Testing Lab. Laptop Required. Note: laptop is required. ACM Categories & Descriptors: D.1.3 Concurrent Programming, E.1 DATA STRUCTURES, F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY General Terms: Algorithms Keywords: Data Structures, Algorithms, C++, OpenMP*, Intel® Cilk Plus, Intel® Threading Building Blocks

Recommended Audience:

Advanced programmers, Beginning programmers, Undergraduate students




Algorithms, C++, Stack, Maps, OpenMP*, Intel Threading Building Blocks, Intel Cilk Plus, Reductions, Reducer, Queue, Stack, Prefix Sum, Nested OpenMP* Locks, Scoped Locking using OpenMP*, Critical Sections, Data Structures
Para obtener información más completa sobre las optimizaciones del compilador, consulte nuestro Aviso de optimización.