Lonestar: A suite of parallel irregular programs

Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including meshing, clustering, simulation, and machine learning, have very different algorithmic foundations: they require building, computing with, and modifying large sparse graphs. In the parallel programming literature, these types of applications are usually classified as irregular applications, and relatively little attention has been paid to them. To study and understand the patterns of parallelism and locality in sparse graph computations better, we are in the process of building the Lonestar benchmark suite. In this paper, we characterize the first five programs from this suite, which target domains like data mining, survey propagation, and design automation. We show that even such irregular applications often expose large amounts of parallelism in the form of amorphous data-parallelism. Our speedup numbers ...

• Type: Conference
• Year: 2009
• Where: ISPASS
• Authors: Milind Kulkarni, Martin Burtscher, Calin Cascaval, Keshav Pingali
• Keywords: Irregular Applications, ISPASS 2009, Parallel Programming, Software Engineering, Sparse Graph