Show simple item record

dc.contributor.authorSalihoglu, Semih
dc.contributor.authorWidom, Jennifer
dc.date.accessioned2016-02-25T13:52:58Z
dc.date.available2016-02-25T13:52:58Z
dc.date.issued2014-03-01
dc.identifier.citationSalihoglu S, Widom J (2014) Optimizing graph algorithms on pregel-like systems. Proceedings of the VLDB Endowment 7: 577–588. Available: http://dx.doi.org/10.14778/2732286.2732294.
dc.identifier.issn2150-8097
dc.identifier.doi10.14778/2732286.2732294
dc.identifier.urihttp://hdl.handle.net/10754/599105
dc.description.abstractWe study the problem of implementing graph algorithms efficiently on Pregel-like systems, which can be surprisingly challenging. Standard graph algorithms in this setting can incur unnecessary inefficiencies such as slow convergence or high communication or computation cost, typically due to structural properties of the input graphs such as large diameters or skew in component sizes. We describe several optimization techniques to address these inefficiencies. Our most general technique is based on the idea of performing some serial computation on a tiny fraction of the input graph, complementing Pregel's vertex-centric parallelism. We base our study on thorough implementations of several fundamental graph algorithms, some of which have, to the best of our knowledge, not been implemented on Pregel-like systems before. The algorithms and optimizations we describe are fully implemented in our open-source Pregel implementation. We present detailed experiments showing that our optimization techniques improve runtime significantly on a variety of very large graph datasets.
dc.description.sponsorshipThis work was supported by the National Science Foundation(IIS-0904497), the Boeing Corporation, a KAUST research grant,and a research grant from Amazon Web Services.
dc.publisherVLDB Endowment
dc.titleOptimizing graph algorithms on pregel-like systems
dc.typeArticle
dc.identifier.journalProceedings of the VLDB Endowment
dc.contributor.institutionStanford University


This item appears in the following Collection(s)

Show simple item record