2012
DOI: 10.1002/widm.1060
|View full text |Cite
|
Sign up to set email alerts
|

Knowledge discovery for scheduling in computational grids

Abstract: International audienceScheduling in computational grids addresses the allocation of computing jobs to globally distributed compute resources. In a frequently changing resource environment, scheduling decisions have to be made rapidly. Depending on both the job properties and the current state of the resources, those decisions are different. Thus, the performance of grid scheduling systems highly depends on their adaptivity and flexibility in changing environments. Under these conditions, methods from knowledge… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 34 publications
(73 reference statements)
0
2
0
Order By: Relevance
“…A decision tree classifier is designed and applied on the extracted features to detect mycelium and conidium from Pap smear sample images (Fölling & Lepping, ). The decision rules that classified conidium among all objects are: 0.8 < Area < 6.7, 1 < Major Axis < 7, 0.68 < Eccentricity < 0.91, 0.6 < Minor Axis < 1.6 and 15 < Compactness < 24 that demonstrated as flowcharts in Figure .…”
Section: Methodsmentioning
confidence: 99%
“…A decision tree classifier is designed and applied on the extracted features to detect mycelium and conidium from Pap smear sample images (Fölling & Lepping, ). The decision rules that classified conidium among all objects are: 0.8 < Area < 6.7, 1 < Major Axis < 7, 0.68 < Eccentricity < 0.91, 0.6 < Minor Axis < 1.6 and 15 < Compactness < 24 that demonstrated as flowcharts in Figure .…”
Section: Methodsmentioning
confidence: 99%
“…The performance of online grid-scheduling algorithms highly depends on their adaptivity and flexibility in changing environments (Flling and Lepping 2012). In practice, the problem of online scheduling is often simplified by converting it into a series of offline problems (Flling and Lepping 2012).…”
Section: Introductionmentioning
confidence: 99%