| Full text | |
| Author(s): |
Total Authors: 2
|
| Affiliation: | [1] Univ Estadual Campinas, Inst Comp, Av Albert Einstein, 1251 Cidade Univ, BR-13083852 Campinas, SP - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | PEER-TO-PEER NETWORKING AND APPLICATIONS; v. 14, n. 2, p. 962-977, MAR 2021. |
| Web of Science Citations: | 2 |
| Abstract | |
Fog computing extends cloud services to the edge of the network. In such scenario, it is necessary to decide where applications should be executed so that their quality of service requirements can be supported. Thus, a cloud-fog system requires an efficient task scheduler to decide the locality where applications should run. This paper presents two schedulers based on integer linear programming, that schedule tasks either in the cloud or on fog resources. The schedulers differ from existing ones by the use of class of services to select the processing elements on which the tasks should be executed. Numerical results evince that the proposed schedulers outperform traditional ones, e.g., Random and Round Robin algorithms without causing violation of QoS requirements. (AU) | |
| FAPESP's process: | 15/24494-8 - Communications and processing of big data in cloud and fog computing |
| Grantee: | Nelson Luis Saldanha da Fonseca |
| Support Opportunities: | Research Projects - Thematic Grants |