Evidence map›Paper›PMID 38660156›Full record

ArticlePeerJ. Computer science2024

Design of load-aware resource allocation for heterogeneous fog computing systems.

Syed Rizwan Hassan, Ateeq Ur Rehman, Naif Alsharabi, Salman Arain, Asim Quddus, Habib Hamam

Abstract read
In one paragraph

Article in PeerJ. Computer science, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Syed Rizwan Hassan *Department of Electrical Engineering, Institute of Engineering and Fertilizer Research, Faisalabad, Pakistan.
Ateeq Ur Rehman *School of Computing, Gachon University, Seongnam, Republic of Korea.
Naif AlsharabiCollege of Computer Science and Engineering, University of Ha'il, Ha'il, Saudi Arabia.
Salman ArainDepartment of Electrical Engineering, Institute of Engineering and Fertilizer Research, Faisalabad, Pakistan.
Asim QuddusDepartment of Electronics Engineering, University of Chakwal, Chakwal, Pakistan.
Habib HamamInternational Institute of Technology and Management, Commune d'Akanda, Libreville, Gabon.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The execution of delay-aware applications can be effectively handled by various computing paradigms, including the fog computing, edge computing, and cloudlets. Cloud computing offers services in a centralized way through a cloud server. On the contrary, the fog computing paradigm offers services in a dispersed manner providing services and computational facilities near the end devices. Due to the distributed provision of resources by the fog paradigm, this architecture is suitable for large-scale implementation of applications. Furthermore, fog computing offers a reduction in delay and network load as compared to cloud architecture. Resource distribution and load balancing are always important tasks in deploying efficient systems. In this research, we have proposed heuristic-based approach that achieves a reduction in network consumption and delays by efficiently utilizing fog resources according to the load generated by the clusters of edge nodes. The proposed algorithm considers the magnitude of data produced at the edge clusters while allocating the fog resources. The results of the evaluations performed on different scales confirm the efficacy of the proposed approach in achieving optimal performance.

Indexed as

Cloud computingFog computingLoad awareResource allocation

Identifiers

PMID38660156
PMCPMC11041998

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.