Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
331 11 |
Ultima descărcare din IBN: 2024-03-02 14:11 |
Căutarea după subiecte similare conform CZU |
004.8 (310) |
Искусственный интеллект (307) |
SM ISO690:2012 DOUGANI, Bentabet, DENNAI, Abdeslem. Bandwidth Allocation Algorithm for Makespan Optimization in a Fog-Cloud EnvironmentMonitoring Application. In: Computer Science Journal of Moldova, 2023, vol. 31, nr. 1(91), pp. 45-69. ISSN 1561-4042. DOI: https://doi.org/10.56415/csjm.v31.03 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Volumul 31, Numărul 1(91) / 2023 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
DOI:https://doi.org/10.56415/csjm.v31.03 | ||||||
CZU: 004.8 | ||||||
Pag. 45-69 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
Fog computing technology has emerged to handle a large amount of data generated by the Internet of Things (IoT) terminals and cope with latency-sensitive application requests by allocating computation and storage resources at the edge of the Internet. In many IoT applications, the data acquisition procedures must apply the Directed Acyclic Graph (DAG) to get real-time results. The principal goal of DAG scheduling is to reduce total completion time without breaking priority constraints by properly allocating tasks to processors and arranging task execution sequencing. In this paper, we propose a bandwidthaware workflow allocation (BW-AWA) that schedules tasks by priority to the resource and optimizes the total execution time (Makespan) in the entire computing system. The task allocation process needs to consider the dependency between tasks. The proposed approach is tested with a monitoring application case study, and the results are compared to well-known approaches to demonstrate its effectiveness in optimizing the Makespan. |
||||||
Cuvinte-cheie Cloud computing, Fog Computing, IoT, List scheduling, DAG, Makespan |
||||||
|