Sudoku timings

2016-05-11

Get the code and check out the viz:

sudoku1, sudoku2 etc. are implementations of a Sudoku solver using various degrees and styles of parallelism, where sudoku1 is the “reference” (i.e. completely sequential) implementation. Elapsed times are given in seconds while “speedup” is the ratio of a the reference elapsed time to a given implementation’s elapsed time.

Code is based on the examples from Simon Marlow’s book.

Related posts

I’m still here!
Parallel and concurrent programming in Haskell

Tags

Tableau
Haskell
Concurrency

All content © 2019 Richard Cook. All rights reserved.