2005
DOI: 10.1007/11508380_26
|View full text |Cite
|
Sign up to set email alerts
|

Introducing Grid Speedup Γ : A Scalability Metric for Parallel Applications on the Grid

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2006
2006
2013
2013

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 9 publications
0
6
0
Order By: Relevance
“…Our findings confirm that our solutions to these two grand challenge problems do, in fact, scale on computational grids and can effectively tolerate the heterogeneity inherent in computational grids that plague most applications also covetous of grids' computational power and memory capacity. Hoekstra and Sloot [24] provide an instructive framework for understanding the performance of parallel applications in a homogeneous Grid environment. We are further analyzing the results although the non-homogeneity of the TeraGrid presents challenges for measuring the parameters.…”
Section: Discussionmentioning
confidence: 99%
“…Our findings confirm that our solutions to these two grand challenge problems do, in fact, scale on computational grids and can effectively tolerate the heterogeneity inherent in computational grids that plague most applications also covetous of grids' computational power and memory capacity. Hoekstra and Sloot [24] provide an instructive framework for understanding the performance of parallel applications in a homogeneous Grid environment. We are further analyzing the results although the non-homogeneity of the TeraGrid presents challenges for measuring the parameters.…”
Section: Discussionmentioning
confidence: 99%
“…The component-based approach provides a convenient way to design suitable partitions for both loosely-coupled and tightlycoupled applications. Grids, by providing large computational infrastructures, allow new categories of problems to be solved [11]. For instance, the Jem3D application can solve problems with mesh sizes over 200*200*200, which is impossible on a single cluster with machine equipped of 2GB RAM, because of memory problems.…”
Section: Discussionmentioning
confidence: 99%
“…The performance on the G3 using all three sites is given by the thin solid line with triangles. For all problem sizes N we have measured, the grid speedup Γ [16] is less than 0.15, indicating that the performance is dominated by network communication. The network communication time scales better than the force calculation time, therefore, if N is sufficiently large, force calculation time will overtake the network communication time.…”
Section: Grid Of Pcs With Grapementioning
confidence: 97%