2021
DOI: 10.1016/j.jnca.2020.102944
|View full text |Cite
|
Sign up to set email alerts
|

SPO: A Secure and Performance-aware Optimization for MapReduce Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 41 publications
0
4
0
Order By: Relevance
“…Maleki et al [77] presented a secure and performanceaware optimization framework called SPO, to minimize the makespan of tasks using a two-stage scheduler. SPO applies the HEFT algorithm in Map and Reduce stage, respectively, and considers network traffic in the shuffling phase.…”
Section: Makespan-aware Schedulersmentioning
confidence: 99%
“…Maleki et al [77] presented a secure and performanceaware optimization framework called SPO, to minimize the makespan of tasks using a two-stage scheduler. SPO applies the HEFT algorithm in Map and Reduce stage, respectively, and considers network traffic in the shuffling phase.…”
Section: Makespan-aware Schedulersmentioning
confidence: 99%
“…As for the off-chain solutions, the second-layer solutions such as the first blockchain's lightning network, Ethereum's Raiden network [17], and Plasma [18] are in full swing. Along with the development of scaling technology, some security issues are also drawing attention and many related studies [19][20][21][22] have started to be proposed. As the technology tends to mature, applications of blockchain [23,24] in various scenarios continue to emerge.…”
Section: Backgroundsmentioning
confidence: 99%
“…If VM has newly arrived, then VM is rejected for scheduling (see lines [12][13][14][15]. If the size of the eligibleServers list is one, then the server is added to assignedServer list (see lines [17][18][19]. The list of assignedServer is used to store the optimal server on which VM can be scheduled.…”
Section: Proposed Algorithmmentioning
confidence: 99%
“…If A ′ does not have acceptable stability, then A ′ and A ′′ are two compromised solutions. The server which has the highest resource utilization is stored in the assignedServer list (see lines [16][17][18][19]. If the best alternative A ′ does not have an acceptable advantage, then there are several compromised solutions available.…”
Section: Proposed Algorithmmentioning
confidence: 99%
See 1 more Smart Citation