2003 International Conference on Parallel Processing, 2003. Proceedings. 2003
DOI: 10.1109/icpp.2003.1240605
|View full text |Cite
|
Sign up to set email alerts
|

Running Bag-of-Tasks applications on computational grids: the MyGrid approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
59
0
12

Year Published

2006
2006
2019
2019

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 106 publications
(71 citation statements)
references
References 11 publications
0
59
0
12
Order By: Relevance
“…Cirne et al [5] developed Workqueue with replication (WQR) that keeps computing resources busy so that if a node runs out of work and would become idle, a copy of an unfinished task is assigned to it. In such a way a second chance is given for a faster execution: the two copies of the same task compete.…”
Section: Related Workmentioning
confidence: 99%
“…Cirne et al [5] developed Workqueue with replication (WQR) that keeps computing resources busy so that if a node runs out of work and would become idle, a copy of an unfinished task is assigned to it. In such a way a second chance is given for a faster execution: the two copies of the same task compete.…”
Section: Related Workmentioning
confidence: 99%
“…Their relevance has motivated the development of specialized environments which aim to facilitate the execution of large BoT applications on computational grids and clusters, such as the AppLeS Parameter-Sweep Template (APST) [3] and MyGrid [7].…”
Section: Related Workmentioning
confidence: 99%
“…Compute average execution time on processor P i ; (6) Update task queue; (7) Abort still running replicas of completed tasks; (8) If Processor P i is idle (9) If there are unfinished groups not yet replicated on slower processors (10) Replicate unfinished group into processor P i ; } Fig. 2.…”
Section: Using the I Aff Measure To Schedule Bot Applicationsmentioning
confidence: 99%
“…As aplicações bag of tasks (CIRNE et al, 2003) representam um tipo específico do modelo mestre-escravo. As tarefas são independentes, não se comunicam e podem ser executadas em qualquer ordem.…”
unclassified
“…As tarefas são independentes, não se comunicam e podem ser executadas em qualquer ordem. Aplicações como mineração de dados, simulações Monte Carlo e processamento de imagens utilizam esse modelo de programação (CIRNE et al, 2003).…”
unclassified