2011 International Conference on Consumer Electronics, Communications and Networks (CECNet) 2011
DOI: 10.1109/cecnet.2011.5769114
|View full text |Cite
|
Sign up to set email alerts
|

A framwork for grid workflow scheduling with resource constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…Some examples of scheduling systems that naturally can use any implementations of runtime estimation module are CLAVIRE (ITMO University, St.Petersburg, Russia) [2,11], framework proposed by Ling Yuan at al. [3], and CLOWDRB by Somasundaram and Govindarajan [12].…”
Section: Execution Time In Workflow Schedulingmentioning
confidence: 97%
See 1 more Smart Citation
“…Some examples of scheduling systems that naturally can use any implementations of runtime estimation module are CLAVIRE (ITMO University, St.Petersburg, Russia) [2,11], framework proposed by Ling Yuan at al. [3], and CLOWDRB by Somasundaram and Govindarajan [12].…”
Section: Execution Time In Workflow Schedulingmentioning
confidence: 97%
“…Number of papers are written to describe different implementations of workflow management systems (e.g. [2,3]). The main question researchers address when developing management systems is how to schedule workflow in the most efficient way: minimizing execution time, cost, meet some deadline or other constraints [4,5].…”
Section: Introductionmentioning
confidence: 99%
“…Additionally, in order to monitor the workflow execution process or reschedule the remaining tasks, one can use the estimation system to calculate the remaining execution time at the moment when the workflow is being executed. Some examples of scheduling systems that can use any implementations of the runtime estimation module are CLAVIRE [5], [6], a scheduling framework proposed by Ling Yuan et al [7], and CLOWDRB by Somasundaram and Govindarajan [8]. task ranking and makespans [9], [10] architecture [11], [12], [7], [8] random -Chebyshev inequalities [13], composing quantiles [14] fixed NP parallelizing models [15], [16], [17] optimization algorithms [9], [18], [19], [20] ordinal Round-Robin, greedy etc.…”
Section: Related Workmentioning
confidence: 99%
“…Several papers are difficult to be classified due to two reasons: first, some approaches stay between two classes (e.g. in [9], [15], [16], [17], [10] the execution time is calculated as a mean of random variable, but the variance of the time is not used); second, some researchers focus more on the architecture of scheduling software than on the algorithms, so one can use different estimate representations [12], [8], [7].…”
Section: Related Workmentioning
confidence: 99%