CSC/ECE 506 Spring 2012/ch5a ja: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
== Deletions == | == Deletions == | ||
== Search == | == Search == | ||
= Linked Data Structures = | |||
== Trees == | |||
=== Tree Into === | |||
=== Serial Code Example === | |||
=== Parallel Code Solution === | |||
== Hash Tables == | |||
=== Hash Table Intro === | |||
=== Serial Code Example === | |||
=== Parallel Code Solution === | |||
== Graphs == | |||
=== Graph Intro === | |||
=== Serial Code Example === | |||
=== Parallel Code Solution === | |||
= Quiz = | |||
= References = | |||
Revision as of 13:39, 23 February 2012
Chapter 5a CSC/ECE 506 Spring 2012 / ch5a
An exploration and summary of concurrency issues as it relates to linked-list based data structures such as hash tables, trees, and graphs. This topic examines concurrency problems related to each type and possible solutions to allow for parallelization.