SWARM: A Parallel Programming Framework for Multicore Processors

Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued performance on multicore processors now requires the exploitation of concurrency at the algorithmic level. In this paper, we identify key issues in algorithm design for multicore processors and propose a computational model for these systems. We introduce SWARM (SoftWare and Algorithms for Running on Multi-core), a portable open-source parallel library of basic primitives that fully exploit multicore processors. Using this framework, we have implemented efficient parallel algorithms for important primitive operations such as prefixsums, pointer-jumping, symmetry breaking, and list ranking; for combinatorial problems such as sorting and selection; for parallel graph theoretic algorithms such as spanning tree, minimum spanning tree, graph decomposition, and tree contraction; and for computational genomics applicatio...

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: David A. Bader, Varun Kanade, Kamesh Madduri
• Keywords: Distributed And Parallel Computing, IPPS 2007, Multicore Algorithmic Model, Multicore Processors, SWARM Multicore Framework