## Graph Algorithms for Multicores with Multilevel Caches (2009)

Citations: | 2 - 0 self |

### BibTeX

@MISC{Blakeley09graphalgorithms,

author = {Brandon Blakeley},

title = {Graph Algorithms for Multicores with Multilevel Caches},

year = {2009}

}

### OpenURL

### Abstract

Historically, the primary model of computation employed in the design and analysis of algorithms has been the sequential RAM model. However, recent developments in computer architecture have reduced the efficacy of the sequential RAM model for algorithmic development. In response, theoretical computer scientists have developed models of computation which better reflect these modern architectures. In this project, we consider a variety of graph problems on parallel, cache-efficient, and multicore models of computation. We introduce each model by defining the analysis of algorithms on these models. Then, for each model, we present current results for the problems of prefix sums, list ranking, various tree problems, connected components, and minimum spanning tree. Finally, we present our novel results, which include the multicore oblivious extension of current results on a private cache multicore model to a more general multilevel multicore