CSC/ECE 506 Spring 2015/5b SA: Difference between revisions
Jump to navigation
Jump to search
| Line 3: | Line 3: | ||
Parallelization of computations in the presence of dynamic data structures has shown immense potential. Here we discuss | Parallelization of computations in the presence of dynamic data structures has shown immense potential. Here we discuss | ||
how can we parallelize linked data structures. Efficiently exploiting parallelism is fundamental in parallel computing even in the context of dynamic data structures. Some amount of '''speculation''' is needed to figure out how to exploit it the best. | how can we parallelize linked data structures. Efficiently exploiting parallelism is fundamental in parallel computing even in the context of dynamic data structures. Some amount of '''speculation''' is needed to figure out how to exploit it the best. | ||
We discuss the major steps in parallelizing data structures and then discuss some techniques and algorithms existing in the literature to gain more insight into | We discuss the major steps in parallelizing data structures and then discuss some techniques and algorithms existing in the literature to gain more insight into the process. | ||
==Overview== | ==Overview== | ||
Revision as of 21:18, 25 February 2015
Introduction
Parallelization of computations in the presence of dynamic data structures has shown immense potential. Here we discuss how can we parallelize linked data structures. Efficiently exploiting parallelism is fundamental in parallel computing even in the context of dynamic data structures. Some amount of speculation is needed to figure out how to exploit it the best. We discuss the major steps in parallelizing data structures and then discuss some techniques and algorithms existing in the literature to gain more insight into the process.
Overview
Algorithms
One algorithm to perform parallelization of data structures is PLDS.