A web-site-based partitioning technique for reducing preprocessing overhead of parallel PageRank computation

Simple item page
buir.contributor.authorAykanat, Cevdet
dc.citation.epage918en_US
dc.citation.spage908en_US
dc.citation.volumeNumber4699en_US
dc.contributor.authorCevahir, Alien_US
dc.contributor.authorAykanat, Cevdeten_US
dc.contributor.authorTurk, Ataen_US
dc.contributor.authorCambazoğlu, B. Barlaen_US
dc.coverage.spatialUmeå, Swedenen_US
dc.date.accessioned2016-02-08T11:43:14Z
dc.date.available2016-02-08T11:43:14Z
dc.date.issued2007en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.descriptionConference name: 8th International Workshop, PARA 2006en_US
dc.descriptionDate of Conference: June 18-21, 2006en_US
dc.description.abstractA power method formulation, which efficiently handles the problem of dangling pages, is investigated for parallelization of PageRank computation. Hypergraph-partitioning-based sparse matrix partitioning methods can be successfully used for efficient parallelization. However, the preprocessing overhead due to hypergraph partitioning, which must be repeated often due to the evolving nature of the Web, is quite significant compared to the duration of the PageRank computation. To alleviate this problem, we utilize the information that sites form a natural clustering on pages to propose a site-based hypergraph-partitioning technique, which does not degrade the quality of the parallelization. We also propose an efficient parallelization scheme for matrix-vector multiplies in order to avoid possible communication due to the pages without in-links. Experimental results on realistic datasets validate the effectiveness of the proposed models. © Springer-Verlag Berlin Heidelberg 2007.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T11:43:14Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2007en
dc.identifier.doi10.1007/978-3-540-75755-9_108en_US
dc.identifier.doi10.1007/978-3-540-75755-9en_US
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11693/27060
dc.language.isoEnglishen_US
dc.publisherSpringer, Berlin, Heidelbergen_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-540-75755-9_108en_US
dc.relation.isversionofhttps://doi.org/10.1007/978-3-540-75755-9en_US
dc.source.titleApplied Parallel Computing. State of the Art in Scientific Computingen_US
dc.subjectClustering algorithmsen_US
dc.subjectComputation theoryen_US
dc.subjectData structuresen_US
dc.subjectParallel processing systemsen_US
dc.subjectProblem solvingen_US
dc.subjectPageRank computationen_US
dc.subjectParallelizationen_US
dc.subjectWebsitesen_US
dc.titleA web-site-based partitioning technique for reducing preprocessing overhead of parallel PageRank computationen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A web-site-based partitioning technique for reducing preprocessing overhead of parallel PageRank computation.pdf
Size:
450.91 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Computer Engineering