2020
DOI: 10.1007/978-3-030-38991-8_43
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Approach to Cost-Efficient Scheduling of Multi-workflows in the Edge Computing Environment with the Proximity Constraint

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…The main idea and the research road-map of Edge Intelligence were provided. VOLUME 8, 2020 In 2020, a scheduling method has been proposed [63] to address the multi-workflow scheduling problem with proximity constraint in the Edge Computing environment. The main aim is to minimise costs.…”
Section: B Related Workmentioning
confidence: 99%
“…The main idea and the research road-map of Edge Intelligence were provided. VOLUME 8, 2020 In 2020, a scheduling method has been proposed [63] to address the multi-workflow scheduling problem with proximity constraint in the Edge Computing environment. The main aim is to minimise costs.…”
Section: B Related Workmentioning
confidence: 99%
“…Recently, the edge computing paradigm has evolved as an increasingly popular force for supporting and enabling business process and scientific workflow execution [3][4][5]. A workflow is a set of dependent or independent tasks illustrated as a directed acyclic graph (DAG) [6][7][8], in which the nodes indicate the tasks and a directed arch represents the interdependency among the corresponding tasks.…”
Section: Introductionmentioning
confidence: 99%