1997
DOI: 10.1006/jpdc.1997.1376
|View full text |Cite
|
Sign up to set email alerts
|

A Task Duplication Based Scalable Scheduling Algorithm for Distributed Memory Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2004
2004
2021
2021

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 35 publications
(14 citation statements)
references
References 17 publications
0
14
0
Order By: Relevance
“…This technique is mostly applicable on dependent tasks (DAG) in order to balance the load as well as minimize the execution cost of complete DAG [14,15].…”
Section: (Ii) Task Duplication Task Duplication Methods Is Given Onmentioning
confidence: 99%
“…This technique is mostly applicable on dependent tasks (DAG) in order to balance the load as well as minimize the execution cost of complete DAG [14,15].…”
Section: (Ii) Task Duplication Task Duplication Methods Is Given Onmentioning
confidence: 99%
“…These approaches are trading additional computational power for lower communication overhead. Although in practice, the cost of computation prevents the use of task duplication approaches, whenever the expense can be justified, these approaches can significantly reduce the makespan of computation [12,19,[39][40][41][42][43][44][45].…”
Section: Related Workmentioning
confidence: 99%
“…Duplication based scheduling strategies address the problem that inter-processor communication in parallel and distributed systems accounts for a major portion of total system overhead. Many researchers have demonstrated that various strategies regarding task duplication are extremely applicable for reducing total execution time within a system employing static scheduling [3][21][9] [10]. However, most of the existing duplication-based scheduling algorithms are developed with consideration of schedule lengths, completely ignoring energy consumption of clusters.…”
Section: Related Workmentioning
confidence: 99%