Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2009

Lonestar: A suite of parallel irregular programs

Milind Kulkarni, Martin Burtscher, Cǎlin Caşcaval, Keshav Pingali

Cited by 184Abstract and details only

Abstract

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 demonstrate that this new type of parallelism can successfully be exploited on modern multi-core machines.

Cite this paper

APA 7

Kulkarni, M., Burtscher, M., Caşcaval, C., & Pingali, K. (2009). Lonestar: A suite of parallel irregular programs. https://doi.org/10.1109/ispass.2009.4919639

MLA 9

Kulkarni, Milind, et al. “Lonestar: A suite of parallel irregular programs.” 2009, pp. 65–76, https://doi.org/10.1109/ispass.2009.4919639.

Chicago

Kulkarni, Milind, Martin Burtscher, Cǎlin Caşcaval, and Keshav Pingali. 2009. “Lonestar: A suite of parallel irregular programs.” https://doi.org/10.1109/ispass.2009.4919639.

Harvard

Kulkarni, M. et al. (2009) ‘Lonestar: A suite of parallel irregular programs’. Available at: https://doi.org/10.1109/ispass.2009.4919639.

BibTeX
@article{kulkarni2009lonestar,
  title = {{Lonestar: A suite of parallel irregular programs}},
  author = {Kulkarni, Milind and Burtscher, Martin and Caşcaval, Cǎlin and Pingali, Keshav},
  pages = {65--76},
  year = {2009},
  doi = {10.1109/ispass.2009.4919639}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers