/
Hadoop-Harp Applications Performance Analysis Hadoop-Harp Applications Performance Analysis

Hadoop-Harp Applications Performance Analysis - PowerPoint Presentation

stefany-barnette
stefany-barnette . @stefany-barnette
Follow
374 views
Uploaded On 2017-07-09

Hadoop-Harp Applications Performance Analysis - PPT Presentation

on Big Red II Notes For KMeans Clustering and FR Graph Drawing Algorithm I use execution time and speedup to explain the performance because T hey can be drawn in one picture Due to the intensive computation I find these applications are easy to achieve linear speedup when the nu ID: 568235

nodes big jvm red big nodes red jvm 128 benchmark newratio survivorratio settings speedup execution time wda full smacof

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "Hadoop-Harp Applications Performance Ana..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript

Slide1

Hadoop-Harp Applications Performance Analysis on Big Red IISlide2

NotesFor K-Means Clustering and FR Graph Drawing

Algorithm,

I use execution time and speedup to explain the

performance

because

T

hey can be drawn in one picture.

Due to the intensive computation, I find these applications are easy to achieve linear speedup when the number of nodes is small.

Therefore

the parallel efficiency is always around 1.Slide3

K-Means Clustering Execution Time and Speedup on Big Red II (10 Iterations Benchmark, Nodes: 8, 16, 32, 64, 128, JVM settings:

-Xmx44000m –Xms44000m -

XX:NewRatio

=1 -

XX:SurvivorRatio=98)Slide4

FR Graph Drawing Algorithm Execution Time and Speedup on Big Red II (477111 Vertices and 665599 Undirected Edges,

10 Iterations Benchmark, Nodes: 1, 8, 16, 32, 64, 128, JVM settings: -Xmx44000m

–Xms44000m -

XX:NewRatio=1 -XX:SurvivorRatio

=98)Slide5

WDA-SMACOF Execution Time on Big Red II (Full Application Benchmark, Nodes: 8, 16, 32, 64, 128, JVM settings:

-Xmx54000m -Xms54000m, -

XX:NewRatio

=1 -

XX:SurvivorRatio=98)Slide6

WDA-SMACOF Parallel Efficiency on Big Red II

(Full Application Benchmark, Nodes: 8, 16, 32, 64, 128, JVM settings:

-Xmx54000m -Xms54000m -

XX:NewRatio

=1 -XX:SurvivorRatio

=98)Slide7

WDA-SMACOF Speedup on Big Red II

(Full Application Benchmark, Nodes: 8, 16, 32, 64, 128, JVM settings

:

-

Xmx54000m -Xms54000m -XX:NewRatio=1 -

XX:SurvivorRatio

=98)