2010 IEEE International Symposium on Parallel &Amp; Distributed Processing, Workshops and PHD Forum (IPDPSW) 2010
DOI: 10.1109/ipdpsw.2010.5470724
|View full text |Cite
|
Sign up to set email alerts
|

Scalability analysis of embarassingly parallel applications on large clusters

Abstract: Abstract-This work presents a scalability analysis of embarrassingly parallel applications running on cluster and multi-cluster machines. Several applications can be included in this category. Examples are Bag-of-tasks (BoT) applications and some classes of online web services, such as index processing in online web search. The analysis presented here is divided in two parts: first, the impact of front end topology on scalability is assessed through a lower bound analysis. In a second step several task mapping… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…Reference [12] discussed static and dynamic parallel scheduling for execution times of various tasks underlying a heterogeneous platform. Recently, a ''superior/master/slave'' hierarchical topology for task assignment is presented in [13]. Reference [13] revisited the classic master/slave solution to schedule embarrassingly parallel tasks, which is the master for scheduling tasks heuristically.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Reference [12] discussed static and dynamic parallel scheduling for execution times of various tasks underlying a heterogeneous platform. Recently, a ''superior/master/slave'' hierarchical topology for task assignment is presented in [13]. Reference [13] revisited the classic master/slave solution to schedule embarrassingly parallel tasks, which is the master for scheduling tasks heuristically.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, a ''superior/master/slave'' hierarchical topology for task assignment is presented in [13]. Reference [13] revisited the classic master/slave solution to schedule embarrassingly parallel tasks, which is the master for scheduling tasks heuristically. Various task-process mapping algorithms are studied according to input data patterns.…”
Section: Introductionmentioning
confidence: 99%