2009 IEEE International Symposium on Parallel and Distributed Processing With Applications 2009
DOI: 10.1109/ispa.2009.98
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing Message Passing Programs Based on Task Section Duplication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…[7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22] These algorithms have applied several methods to scheduling tasks. The common methods are listscheduling based, cluster based, and duplication based.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…[7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22] These algorithms have applied several methods to scheduling tasks. The common methods are listscheduling based, cluster based, and duplication based.…”
Section: Introductionmentioning
confidence: 99%
“…15 The main idea behind duplication-based algorithms is try to duplicate the parent nodes of the current selected task onto the selected machine or onto another machine(s), which may eliminate waiting time on other processors. [16][17][18][19][20][21][22] The main weakness of duplication-based algorithms is their high complexity.…”
Section: Introductionmentioning
confidence: 99%