2021
DOI: 10.1109/access.2021.3068817
|View full text |Cite
|
Sign up to set email alerts
|

RACE: Resource Aware Cost-Efficient Scheduler for Cloud Fog Environment

Abstract: Fog Computing is one of the new computing structures which takes the Cloud to the verge of the network. The structure is formulated for applications that need low latency. Fog Computing has been projected to improve the disadvantages of Cloud Computing. The system is confronted with the variability of dynamic resources that are heterogeneous and distributed. Hence, efficient scheduling and resource allocation are necessary to maximize the use of these resources and the satisfaction of users. In this paper, a r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 16 publications
(22 citation statements)
references
References 33 publications
0
22
0
Order By: Relevance
“…Figure 8 shows that the execution time of A 1 for GA-IRACE is significantly improved compared to using the conventional method for cloud placement. It can be seen in Figure 8 that the execution time of A 1 improves for the GA-IRACE as compared to the traditional cloud placement, RACE [13], Taneja and Davy [41], and the random placement. For A 2 , the bandwidth-intensive application RACE [13] has a better execution time than Taneja and Davy [41], traditional cloud placement, and the random solution; however, the GA-IRACE has a better execution time than all baseline algorithms.…”
Section: Discussion Of Experimental Resultsmentioning
confidence: 98%
See 4 more Smart Citations
“…Figure 8 shows that the execution time of A 1 for GA-IRACE is significantly improved compared to using the conventional method for cloud placement. It can be seen in Figure 8 that the execution time of A 1 improves for the GA-IRACE as compared to the traditional cloud placement, RACE [13], Taneja and Davy [41], and the random placement. For A 2 , the bandwidth-intensive application RACE [13] has a better execution time than Taneja and Davy [41], traditional cloud placement, and the random solution; however, the GA-IRACE has a better execution time than all baseline algorithms.…”
Section: Discussion Of Experimental Resultsmentioning
confidence: 98%
“…In the experiments, the proposed scheduling algorithm GA-IRACE was compared with the conventional cloud placement, RACE [13], and the other baseline algorithms, i.e., Taneja and Davy [41] and the random solution in terms of execution time, monetary cost, and bandwidth. The simulation findings (Figures 8-16) show that the proposed placement technique has a tremendously positive effect on execution time, the bandwidth, and the monetary cost of applications in all three network topologies tested.…”
Section: Discussion Of Experimental Resultsmentioning
confidence: 99%
See 3 more Smart Citations