EUVIMEDEUVIMED entdecken
Crossref

CHALLENGES IN PARALLEL GRAPH PROCESSING

ANDREW LUMSDAINE, DOUGLAS GREGOR, BRUCE HENDRICKSON, JONATHAN BERRY

Parallel Processing Letters · 2007-03 · 17 (01) · 5-20

DOI: 10.1142/s0129626407002843 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Parallel Processing Letters, online erschienen am 21.11.2011. Verfasst von ANDREW LUMSDAINE und 3 weiteren Autor:innen. Die Arbeit wurde bisher 342-mal zitiert (Crossref) und nennt 7 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel computing resources are required to meet their computational and memory requirements. Unfortunately, the algorithms, software, and hardware that have worked well for developing mainstream parallel scientific applications are not necessarily effective for large-scale graph problems. In this paper we present the inter-relationships between graph problems, software, and parallel hardware in the current state of the art and discuss how those issues present inherent challenges in solving large-scale graph problems. The range of these challenges suggests a research agenda for the development of scalable high-performance software for graph problems.

Zitieren

APA

LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J. (2007). CHALLENGES IN PARALLEL GRAPH PROCESSING. Parallel Processing Letters, 17(01), 5-20. https://doi.org/10.1142/s0129626407002843

Vancouver

LUMSDAINE A, GREGOR D, HENDRICKSON B, BERRY J. CHALLENGES IN PARALLEL GRAPH PROCESSING. Parallel Processing Letters. 2007;17(01):5-20. doi:10.1142/s0129626407002843

BibTeX
@article{LUMSDAINE2007,
  author = {LUMSDAINE, ANDREW and GREGOR, DOUGLAS and HENDRICKSON, BRUCE and BERRY, JONATHAN},
  title = {CHALLENGES IN PARALLEL GRAPH PROCESSING},
  journal = {Parallel Processing Letters},
  year = {2007},
  volume = {17},
  number = {01},
  pages = {5--20},
  doi = {10.1142/s0129626407002843}
}
Kostenlos starten →