A Brief Survey of Algorithms, Architectures, and Challenges toward Extreme-scale Graph Analytics

The notion of networks is inherent in the structure, function and behavior of the natural and engineered world that surround us. Consequently, graph models and methods have assumed a prominent role to play in this modern era of Big Data, and are taking a center stage in the discovery pipelines of va...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings - Design, Automation, and Test in Europe Conference and Exhibition s. 1307 - 1312
Hlavní autoři: Kalyanaraman, Ananth, Pande, Partha Pratim
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: EDAA 01.03.2019
Témata:
ISSN:1558-1101
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The notion of networks is inherent in the structure, function and behavior of the natural and engineered world that surround us. Consequently, graph models and methods have assumed a prominent role to play in this modern era of Big Data, and are taking a center stage in the discovery pipelines of various data-driven scientific domains. In this paper, we present a brief review of the state-of-the-art in parallel graph analytics, particularly focusing on iterative graph algorithms and their implementation on modern day multicore/manycore architectures. The class of iterative graph algorithms covers a broad class of graph operations of varying complexities, from simpler routines such as Breadth-First Search (BFS), to polynomially-solvable problems such as shortest path computations, to NP-Hard problems such as community detection and graph coloring. We cover a set of common algorithmic abstractions used in implementing such iterative graph algorithms, state the challenges around parallelization on contemporary parallel platforms (including commodity multicores and emerging manycore platforms), and describe a set of approaches that have led to efficient implementations. We also report on advances in manycore architectural frameworks that have found application in parallel graph analytics. We conclude the paper identifying potential research directions, opportunities, and challenges that lay ahead in the path toward enabling graph analytics at exascale.
AbstractList The notion of networks is inherent in the structure, function and behavior of the natural and engineered world that surround us. Consequently, graph models and methods have assumed a prominent role to play in this modern era of Big Data, and are taking a center stage in the discovery pipelines of various data-driven scientific domains. In this paper, we present a brief review of the state-of-the-art in parallel graph analytics, particularly focusing on iterative graph algorithms and their implementation on modern day multicore/manycore architectures. The class of iterative graph algorithms covers a broad class of graph operations of varying complexities, from simpler routines such as Breadth-First Search (BFS), to polynomially-solvable problems such as shortest path computations, to NP-Hard problems such as community detection and graph coloring. We cover a set of common algorithmic abstractions used in implementing such iterative graph algorithms, state the challenges around parallelization on contemporary parallel platforms (including commodity multicores and emerging manycore platforms), and describe a set of approaches that have led to efficient implementations. We also report on advances in manycore architectural frameworks that have found application in parallel graph analytics. We conclude the paper identifying potential research directions, opportunities, and challenges that lay ahead in the path toward enabling graph analytics at exascale.
Author Pande, Partha Pratim
Kalyanaraman, Ananth
Author_xml – sequence: 1
  givenname: Ananth
  surname: Kalyanaraman
  fullname: Kalyanaraman, Ananth
  organization: School of EECS, Washington State University, Pullman, WA, USA
– sequence: 2
  givenname: Partha Pratim
  surname: Pande
  fullname: Pande, Partha Pratim
  organization: School of EECS, Washington State University, Pullman, WA, USA
BookMark eNotkEtOwzAUAA0CibZwAdj4ACT4U8f2MpRSkCqxoKzLS_LSGOVT2S6Q21OJrkazmcVMyUU_9EjILWepkJbbh6d8s0wF4zY1mism5mdkKq3hVmRSyHMy4UqZhHPGr8g0hC_GmJLCTshnTh-9w5q-H_w3jnSoad7uBu9i04V7mvuycRHLePB4VOgrumigbbHfYaBx-AFf0eVv9NhhEkpoka487Bua99CO0ZXhmlzW0Aa8OXFGPp6Xm8VLsn5bvS7ydeK4VjFRNdNFUVQSlNZMG24EmMJwNCh1BjbL5gVXtZXAVC1KI8ojoNJKGFsJBnJG7v67DhG3e-868OP2dEP-AVOLVZA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.23919/DATE.2019.8715024
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISBN 3981926323
9783981926323
EISSN 1558-1101
EndPage 1312
ExternalDocumentID 8715024
Genre orig-research
GroupedDBID 123
29F
29O
6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
FEDTE
IEGSK
IPLJI
KZ1
LMP
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i175t-5f07bbbd3a577078182a8b81e8e376a9664b15f93a05f2c82c5f2ad75289d20a3
IEDL.DBID RIE
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000470666100243&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:47:06 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-5f07bbbd3a577078182a8b81e8e376a9664b15f93a05f2c82c5f2ad75289d20a3
PageCount 6
ParticipantIDs ieee_primary_8715024
PublicationCentury 2000
PublicationDate 2019-March
PublicationDateYYYYMMDD 2019-03-01
PublicationDate_xml – month: 03
  year: 2019
  text: 2019-March
PublicationDecade 2010
PublicationTitle Proceedings - Design, Automation, and Test in Europe Conference and Exhibition
PublicationTitleAbbrev DATE
PublicationYear 2019
Publisher EDAA
Publisher_xml – name: EDAA
SSID ssj0005329
Score 2.088803
Snippet The notion of networks is inherent in the structure, function and behavior of the natural and engineered world that surround us. Consequently, graph models and...
SourceID ieee
SourceType Publisher
StartPage 1307
SubjectTerms Computational modeling
Convergence
extreme-scale computing
Image edge detection
irregular applications
Iterative algorithms
Multicore processing
parallel architectures
Parallel graph algorithms
Topology
Title A Brief Survey of Algorithms, Architectures, and Challenges toward Extreme-scale Graph Analytics
URI https://ieeexplore.ieee.org/document/8715024
WOSCitedRecordID wos000470666100243&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LTsJAFJ0AcaEbFDC-MwuXjNDHMNNlg6ArQiIm7HA6DyXR1pRC9O-9M-Vl4sZVH2nTZG7be87MuecidAspVcteGBHFZI-E1ONEAG4gAPeplp4yEZeu2QQbjfh0Go0rqL2thdFaO_GZvrO7bi1fZXJpp8o6AO4p5JQqqjLWK2u1dnKOwI_Kohg_iLyocx9PBla5Ba9Cedev9ikuewzr_3vuMWrtyvDweJtgTlBFpw1U3_RhwOvPsoGO9kwFm-glxsD4tcFPy3ylv3FmcPz-muXz4u1j0cbx3soBHIpU4f6mocoCF05FiwdfhZ03JAuIoMYP1tQaO_sSa-rcQs_DwaT_SNZ9FMgcwEFBqOmyJElUIChz5j7cFzzhnuYafi8CCE-YeNREgehS40vuS9gIxSiQMeV3RXCKammW6jOEvUAyuISGmqpQKl8AAEx84LnMALUxyTlq2uGbfZZWGbP1yF38ffoSHdoIlZKuK1Qr8qW-RgdyVcwX-Y2L7w9EX6bS
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT4NAEJ3UaqJeqm2N3-7BY7GwsAWOpLbWWJsm1qS3uuwu2kTBAG303ztAv0y8eOIjEJIdYN7bffMG4BpTqhIty9WkLVqaxQxH44gbNIT7TAlDBq4j8mYT9mDgjMfusASNVS2MUioXn6mbbDdfy5eRmGVTZU0E9wxzyhZsM8uielGttRZ0mNQtymKo6Rpu89YbdTLtFr4MxX2_Gqjk-aNb-d-TD6C-LsQjw1WKOYSSCqtQWXZiIIsPswr7G7aCNXjxCHJ-FZCnWTxX3yQKiPf-GsXT9O0jaRBvY-0AD3koSXvZUiUhaa6jJZ2vNJs51BKMoSJ3ma01yQ1MMlvnOjx3O6N2T1t0UtCmCA9SjQW67fu-NDmzc3sfh3LHdwzlKPzBcKQ8lm-wwDW5zgIqHCpww6XNkI5JqnPzCMphFKpjIIYpbLyEWYpJS0jKEQL6FJmuHSC5CfwTqGXDN_kszDImi5E7_fv0Fez2Ro_9Sf9-8HAGe1m0CoHXOZTTeKYuYEfM02kSX-ax_gEelKoZ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+-+Design%2C+Automation%2C+and+Test+in+Europe+Conference+and+Exhibition&rft.atitle=A+Brief+Survey+of+Algorithms%2C+Architectures%2C+and+Challenges+toward+Extreme-scale+Graph+Analytics&rft.au=Kalyanaraman%2C+Ananth&rft.au=Pande%2C+Partha+Pratim&rft.date=2019-03-01&rft.pub=EDAA&rft.eissn=1558-1101&rft.spage=1307&rft.epage=1312&rft_id=info:doi/10.23919%2FDATE.2019.8715024&rft.externalDocID=8715024