CSC/ECE 506 Spring 2012/ch5a ja: Difference between revisions
		
		
		
		Jump to navigation
		Jump to search
		
| No edit summary | |||
| Line 1: | Line 1: | ||
| == Chapter 5a CSC/ECE 506 Spring 2012 / ch5a == | == 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. | |||
| == Introduction ==   | == Introduction ==   | ||
Revision as of 13:31, 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.