CS-A1140 DSA
  • Round 1: Recap and basic data structures
  • Round 2: Sorting
  • Round 3: Trees
  • Round 4: Binary Search Trees
  • Round 5: Hashing
  • Round 6: Dynamic programming and greedy algorithms
  • Round 7: Graphs, part I
  • Round 8: Graphs, part II
  • Round 9: Multithreaded algorithms
    • Introduction
    • Basic definitions
    • Threads
    • Parallel for-loops
    • Embarrassingly parallel problems
    • Fork-join framework
    • Example: Implementing parallel count
    • Parallel mergesort
    • Some parallel methods in the standard libraries
  • Round 10: Computationally more difficult problems
  • External links
CS-A1140 DSA
  • Round 9: Multithreaded algorithms

Round 9: Multithreaded algorithms

Contents:

  • Introduction
  • Basic definitions
  • Threads
  • Parallel for-loops
  • Embarrassingly parallel problems
  • Fork-join framework
  • Example: Implementing parallel count
  • Parallel mergesort
  • Some parallel methods in the standard libraries

Some material in the book Introduction to Algorithms (Aalto access):

  • ​ Sections 27.1 and 27.3

Previous Next

© Copyright 2016-2023, Tommi Junttila.

Built with Sphinx using a theme provided by Read the Docs.