Deriving Highly Efficient Implementations of Parallel PageRank

Strien, Bart van; Rietveld, Kristian F. D.; Wijshoff, Harry A. G.

doi:10.1109/icppw.2017.26

Search citation statements

Order By: Relevance

Paper Sections

Select...

• Extension Of Conference Papers Published At the Internatio...1

Transformations and Implementations1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…on Parallel Processing Workshops (ICPPW) [14] and the ACM Conference on Computing Frontiers [15]. • A.…”

Section: • Extension Of Conference Papers Published At the Internatio...mentioning

confidence: 99%

See 1 more Smart Citation

A New Framework for Expressing, Parallelizing and Optimizing Big Data Applications

Hommelberg¹,

Strien²,

Rietveld³

et al. 2022

Preprint

View full text Add to dashboard Cite

The Forelem framework was first introduced as a means to optimize database queries using optimization techniques developed for compilers. Since its introduction, Forelem has proven to be more versatile and to be applicable beyond database applications. In this paper we show that the original Forelem framework can be used to express and optimize Big Data applications, more specifically: k-Means clustering and PageRank, resulting in automatically generated implementations of these applications. These implementations are more efficient than state-of-the-art, hand-written MPI C/C++ implementations of k-Means and PageRank, as well as significantly outperform state-of-the-art Hadoop implementations.

show abstract

“…on Parallel Processing Workshops (ICPPW) [14] and the ACM Conference on Computing Frontiers [15]. • A.…”

Section: • Extension Of Conference Papers Published At the Internatio...mentioning

confidence: 99%

“…Note that more transformations, and many more implementations are possible. For a detailed description we refer to [11], and for the automatic generation of the associated data structures and the overall automation process we refer to [1], [14].…”

Section: Transformations and Implementationsmentioning

confidence: 99%