File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)

Conference Paper: GraVF: a vertex-centric distributed graph processing framework on FPGAs

TitleGraVF: a vertex-centric distributed graph processing framework on FPGAs
Authors
Issue Date2016
PublisherIEEE.
Citation
The 26th International Conference on Field-Programmable Logic and Applications (FPL 2016), Lausanne, Switzerland, 29 August-2 September 2016. In Conference Proceedings, 2016, article no. 7577360 How to Cite?
AbstractFPGAs are promising platforms to efficiently execute distributed graph algorithms. Unfortunately, they are notoriously hard to program, especially when the problem size and system complexity increases. In this paper, we propose GraVF, a high-level design framework for distributed graph processing on FPGAs. It leverages the vertex-centric paradigm, which is naturally distributed and requires the user to define only very small kernels and their associated message semantics for the target application. The user design may subsequently be elaborated and compiled to the target system automatically by the framework. To demonstrate the flexibility and capabilities of the proposed framework, 4 graph algorithms with distinct requirements have been implemented, namely breadth-first search, PageRank, single source shortest path, and connected component. Results show that the proposed framework is capable of producing FPGA designs with performance comparable to similar custom designs while requiring only minimal input from the user. © 2016 EPFL.
Persistent Identifierhttp://hdl.handle.net/10722/234982
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorEngelhardt, N-
dc.contributor.authorSo, HKH-
dc.date.accessioned2016-10-14T13:50:31Z-
dc.date.available2016-10-14T13:50:31Z-
dc.date.issued2016-
dc.identifier.citationThe 26th International Conference on Field-Programmable Logic and Applications (FPL 2016), Lausanne, Switzerland, 29 August-2 September 2016. In Conference Proceedings, 2016, article no. 7577360-
dc.identifier.isbn978-283991844-2-
dc.identifier.issn1946-1488 (electronic)-
dc.identifier.urihttp://hdl.handle.net/10722/234982-
dc.description.abstractFPGAs are promising platforms to efficiently execute distributed graph algorithms. Unfortunately, they are notoriously hard to program, especially when the problem size and system complexity increases. In this paper, we propose GraVF, a high-level design framework for distributed graph processing on FPGAs. It leverages the vertex-centric paradigm, which is naturally distributed and requires the user to define only very small kernels and their associated message semantics for the target application. The user design may subsequently be elaborated and compiled to the target system automatically by the framework. To demonstrate the flexibility and capabilities of the proposed framework, 4 graph algorithms with distinct requirements have been implemented, namely breadth-first search, PageRank, single source shortest path, and connected component. Results show that the proposed framework is capable of producing FPGA designs with performance comparable to similar custom designs while requiring only minimal input from the user. © 2016 EPFL.-
dc.languageeng-
dc.publisherIEEE.-
dc.relation.ispartof26th International Conference on Field-Programmable Logic and Applications, FPL 2016 Proceedings-
dc.rights26th International Conference on Field-Programmable Logic and Applications, FPL 2016 Proceedings. Copyright © IEEE.-
dc.rights©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.titleGraVF: a vertex-centric distributed graph processing framework on FPGAs-
dc.typeConference_Paper-
dc.identifier.emailSo, HKH: hso@eee.hku.hk-
dc.identifier.authoritySo, HKH=rp00169-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.1109/FPL.2016.7577360-
dc.identifier.scopuseid_2-s2.0-84994802529-
dc.identifier.hkuros268688-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 161202-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats