Comparison of OpenMP and Threading Building Blocks for expressing parallelism on shared-memory systems

Abstract

The thesis offers a comparison of OpenMP and Intel Threading Building blocks. The two are threading packages used to express parallelism in programs. In addition, the thesis presents a promising scalable algorithm for finding connected components in graphs using disjoint set data structures.