2016
DOI: 10.20894/ijcnes.103.005.002.001
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of Balanced Minimum Execution Time Grid Task scheduling Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…The applied hybrid optimization mechanism based on the minimum execution time (MET) packet scheduling method and moth flame optimization (MFO) scheme to provide the optimal route. In the MET method, the packets (tasks) are assigned to the mobile nodes in reliance on the finest predictable completion intervals of the process execution without paying attention to the resource accessibility [48,49]. The execution time represents the required time interval to process the packet on the node without interruption [50].…”
Section: Minimum Execution Time (Met) Scheduling Algorithmmentioning
confidence: 99%
“…The applied hybrid optimization mechanism based on the minimum execution time (MET) packet scheduling method and moth flame optimization (MFO) scheme to provide the optimal route. In the MET method, the packets (tasks) are assigned to the mobile nodes in reliance on the finest predictable completion intervals of the process execution without paying attention to the resource accessibility [48,49]. The execution time represents the required time interval to process the packet on the node without interruption [50].…”
Section: Minimum Execution Time (Met) Scheduling Algorithmmentioning
confidence: 99%