An efficient memory data organization strategy for application-characteristic graph processing
Conclusion In this paper, we focus on the memory data organization strategy based on application operating characteristics and present GMDO, an efficient memory data organization strategy composed of GMDO-VR and GMDO-VI for traversal and iterative graph applications, respectively. Extensive experime...
Gespeichert in:
Veröffentlicht in: | Frontiers of Computer Science 2022-02, Vol.16 (1), p.161607, Article 161607 |
---|---|
Hauptverfasser: | , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 1 |
container_start_page | 161607 |
container_title | Frontiers of Computer Science |
container_volume | 16 |
creator | FANG, Peng WANG, Fang SHI, Zhan FENG, Dan YI, Qianxu XU, Xianghao ZHANG, Yongxuan |
description | Conclusion
In this paper, we focus on the memory data organization strategy based on application operating characteristics and present GMDO, an efficient memory data organization strategy composed of GMDO-VR and GMDO-VI for traversal and iterative graph applications, respectively. Extensive experiments show that GMDO exhibits remarkable performance compares with the representative schemes. For state-of-the-art graph systems, our proposed strategy can significantly improve the system acceleration ratio and increase the cache hit ratio. |
doi_str_mv | 10.1007/s11704-020-0255-y |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918721724</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918721724</sourcerecordid><originalsourceid>FETCH-LOGICAL-c365t-38bd3244848f63e5f3ec6c0b7e014a127659dade9e52f1eb12ef7268896406083</originalsourceid><addsrcrecordid>eNp9kM9LwzAUgIsoOHR_gLeA52qStml6HMNfMPCiV0OWvnQZW1pfskP9682s6G2HkEC-7z34suyG0TtGaX0fGKtpmVNO06mqfDzLZpw2Vc55Ic7_3lxeZvMQtpQmMnGcz7KPhSdgrTMOfCR72Pc4klZHTXrstHdfOrrekxBRR-hGYnskehh2zvx85GajUZsI6EJ0hnSohw0ZsDcQgvPddXZh9S7A_Pe-yt4fH96Wz_nq9elluVjlphBVzAu5bgtelrKUVhRQ2QKMMHRdA2WlZrwWVdPqFhqouGWwZhxszYWUjSipoLK4ym6nuWn15wFCVNv-gD6tVLxhsuas5mWi2EQZ7ENAsGpAt9c4KkbVsaSaSqrURx0LqTE5fHJCYn0H-D_5lCQnaeO6DSC0A6YeymLvowM8pX4DZJSJ1g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918721724</pqid></control><display><type>article</type><title>An efficient memory data organization strategy for application-characteristic graph processing</title><source>ProQuest Central UK/Ireland</source><source>SpringerLink Journals - AutoHoldings</source><source>ProQuest Central</source><creator>FANG, Peng ; WANG, Fang ; SHI, Zhan ; FENG, Dan ; YI, Qianxu ; XU, Xianghao ; ZHANG, Yongxuan</creator><creatorcontrib>FANG, Peng ; WANG, Fang ; SHI, Zhan ; FENG, Dan ; YI, Qianxu ; XU, Xianghao ; ZHANG, Yongxuan</creatorcontrib><description>Conclusion
In this paper, we focus on the memory data organization strategy based on application operating characteristics and present GMDO, an efficient memory data organization strategy composed of GMDO-VR and GMDO-VI for traversal and iterative graph applications, respectively. Extensive experiments show that GMDO exhibits remarkable performance compares with the representative schemes. For state-of-the-art graph systems, our proposed strategy can significantly improve the system acceleration ratio and increase the cache hit ratio.</description><identifier>ISSN: 2095-2228</identifier><identifier>EISSN: 2095-2236</identifier><identifier>DOI: 10.1007/s11704-020-0255-y</identifier><language>eng</language><publisher>Beijing: Higher Education Press</publisher><subject>Computer Science ; Letter</subject><ispartof>Frontiers of Computer Science, 2022-02, Vol.16 (1), p.161607, Article 161607</ispartof><rights>Copyright reserved, 2022, Higher Education Press</rights><rights>Higher Education Press 2022</rights><rights>Higher Education Press 2022.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c365t-38bd3244848f63e5f3ec6c0b7e014a127659dade9e52f1eb12ef7268896406083</citedby><cites>FETCH-LOGICAL-c365t-38bd3244848f63e5f3ec6c0b7e014a127659dade9e52f1eb12ef7268896406083</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11704-020-0255-y$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918721724?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,21387,27923,27924,33743,41487,42556,43804,51318,64384,64388,72240</link.rule.ids></links><search><creatorcontrib>FANG, Peng</creatorcontrib><creatorcontrib>WANG, Fang</creatorcontrib><creatorcontrib>SHI, Zhan</creatorcontrib><creatorcontrib>FENG, Dan</creatorcontrib><creatorcontrib>YI, Qianxu</creatorcontrib><creatorcontrib>XU, Xianghao</creatorcontrib><creatorcontrib>ZHANG, Yongxuan</creatorcontrib><title>An efficient memory data organization strategy for application-characteristic graph processing</title><title>Frontiers of Computer Science</title><addtitle>Front. Comput. Sci</addtitle><description>Conclusion
In this paper, we focus on the memory data organization strategy based on application operating characteristics and present GMDO, an efficient memory data organization strategy composed of GMDO-VR and GMDO-VI for traversal and iterative graph applications, respectively. Extensive experiments show that GMDO exhibits remarkable performance compares with the representative schemes. For state-of-the-art graph systems, our proposed strategy can significantly improve the system acceleration ratio and increase the cache hit ratio.</description><subject>Computer Science</subject><subject>Letter</subject><issn>2095-2228</issn><issn>2095-2236</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kM9LwzAUgIsoOHR_gLeA52qStml6HMNfMPCiV0OWvnQZW1pfskP9682s6G2HkEC-7z34suyG0TtGaX0fGKtpmVNO06mqfDzLZpw2Vc55Ic7_3lxeZvMQtpQmMnGcz7KPhSdgrTMOfCR72Pc4klZHTXrstHdfOrrekxBRR-hGYnskehh2zvx85GajUZsI6EJ0hnSohw0ZsDcQgvPddXZh9S7A_Pe-yt4fH96Wz_nq9elluVjlphBVzAu5bgtelrKUVhRQ2QKMMHRdA2WlZrwWVdPqFhqouGWwZhxszYWUjSipoLK4ym6nuWn15wFCVNv-gD6tVLxhsuas5mWi2EQZ7ENAsGpAt9c4KkbVsaSaSqrURx0LqTE5fHJCYn0H-D_5lCQnaeO6DSC0A6YeymLvowM8pX4DZJSJ1g</recordid><startdate>20220201</startdate><enddate>20220201</enddate><creator>FANG, Peng</creator><creator>WANG, Fang</creator><creator>SHI, Zhan</creator><creator>FENG, Dan</creator><creator>YI, Qianxu</creator><creator>XU, Xianghao</creator><creator>ZHANG, Yongxuan</creator><general>Higher Education Press</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20220201</creationdate><title>An efficient memory data organization strategy for application-characteristic graph processing</title><author>FANG, Peng ; WANG, Fang ; SHI, Zhan ; FENG, Dan ; YI, Qianxu ; XU, Xianghao ; ZHANG, Yongxuan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c365t-38bd3244848f63e5f3ec6c0b7e014a127659dade9e52f1eb12ef7268896406083</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science</topic><topic>Letter</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>FANG, Peng</creatorcontrib><creatorcontrib>WANG, Fang</creatorcontrib><creatorcontrib>SHI, Zhan</creatorcontrib><creatorcontrib>FENG, Dan</creatorcontrib><creatorcontrib>YI, Qianxu</creatorcontrib><creatorcontrib>XU, Xianghao</creatorcontrib><creatorcontrib>ZHANG, Yongxuan</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Frontiers of Computer Science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>FANG, Peng</au><au>WANG, Fang</au><au>SHI, Zhan</au><au>FENG, Dan</au><au>YI, Qianxu</au><au>XU, Xianghao</au><au>ZHANG, Yongxuan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An efficient memory data organization strategy for application-characteristic graph processing</atitle><jtitle>Frontiers of Computer Science</jtitle><stitle>Front. Comput. Sci</stitle><date>2022-02-01</date><risdate>2022</risdate><volume>16</volume><issue>1</issue><spage>161607</spage><pages>161607-</pages><artnum>161607</artnum><issn>2095-2228</issn><eissn>2095-2236</eissn><abstract>Conclusion
In this paper, we focus on the memory data organization strategy based on application operating characteristics and present GMDO, an efficient memory data organization strategy composed of GMDO-VR and GMDO-VI for traversal and iterative graph applications, respectively. Extensive experiments show that GMDO exhibits remarkable performance compares with the representative schemes. For state-of-the-art graph systems, our proposed strategy can significantly improve the system acceleration ratio and increase the cache hit ratio.</abstract><cop>Beijing</cop><pub>Higher Education Press</pub><doi>10.1007/s11704-020-0255-y</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2095-2228 |
ispartof | Frontiers of Computer Science, 2022-02, Vol.16 (1), p.161607, Article 161607 |
issn | 2095-2228 2095-2236 |
language | eng |
recordid | cdi_proquest_journals_2918721724 |
source | ProQuest Central UK/Ireland; SpringerLink Journals - AutoHoldings; ProQuest Central |
subjects | Computer Science Letter |
title | An efficient memory data organization strategy for application-characteristic graph processing |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T14%3A50%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20efficient%20memory%20data%20organization%20strategy%20for%20application-characteristic%20graph%20processing&rft.jtitle=Frontiers%20of%20Computer%20Science&rft.au=FANG,%20Peng&rft.date=2022-02-01&rft.volume=16&rft.issue=1&rft.spage=161607&rft.pages=161607-&rft.artnum=161607&rft.issn=2095-2228&rft.eissn=2095-2236&rft_id=info:doi/10.1007/s11704-020-0255-y&rft_dat=%3Cproquest_cross%3E2918721724%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918721724&rft_id=info:pmid/&rfr_iscdi=true |