Task scheduling in cloud-fog computing systems

2021 ◽  
Vol 14 (2) ◽  
pp. 962-977
Author(s):  
Judy C. Guevara ◽  
Nelson L. S. da Fonseca
Keyword(s):  
Task Scheduling ◽  
Fog Computing ◽  
Computing Systems

scholarly journals Enhanced Round-Robin Algorithm in the Cloud Computing Environment for Optimal Task Scheduling

Computers ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 63
Author(s):  
Fahd Alhaidari ◽  
Taghreed Zayed Balharith
Keyword(s):  
Cloud Computing ◽  
Task Scheduling ◽  
Critical Role ◽  
Turnaround Time ◽  
Round Robin ◽  
Computing Systems ◽  
Time Quantum ◽  
Dynamic Time ◽  
High Level ◽  
Level Performance

Recently, there has been significant growth in the popularity of cloud computing systems. One of the main issues in building cloud computing systems is task scheduling. It plays a critical role in achieving high-level performance and outstanding throughput by having the greatest benefit from the resources. Therefore, enhancing task scheduling algorithms will enhance the QoS, thus leading to more sustainability of cloud computing systems. This paper introduces a novel technique called the dynamic round-robin heuristic algorithm (DRRHA) by utilizing the round-robin algorithm and tuning its time quantum in a dynamic manner based on the mean of the time quantum. Moreover, we applied the remaining burst time of the task as a factor to decide the continuity of executing the task during the current round. The experimental results obtained using the CloudSim Plus tool showed that the DRRHA significantly outperformed the competition in terms of the average waiting time, turnaround time, and response time compared with several studied algorithms, including IRRVQ, dynamic time slice round-robin, improved RR, and SRDQ algorithms.

scholarly journals Time-constrained strong multi-designated verifier signature suitable for Internet of things–based collaborative fog computing systems

2021 ◽  
Vol 17 (3) ◽  
pp. 155014772110017
Author(s):  
Han-Yu Lin
Keyword(s):  
Internet Of Things ◽  
Fog Computing ◽  
Discrete Logarithm ◽  
Signature Scheme ◽  
Computing Systems ◽  
Extended Technique ◽  
Diffie Hellman ◽  
Designated Verifier ◽  
Designated Verifier Signature ◽  
Cloud Servers

Fog computing is viewed as an extended technique of cloud computing. In Internet of things–based collaborative fog computing systems, a fog node aggregating lots of data from Internet of things devices has to transmit the information to distributed cloud servers that will collaboratively verify it based on some predefined auditing policy. However, compromised fog nodes controlled by an adversary might inject bogus data to cheat or confuse remote servers. It also causes the waste of communication and computation resources. To further control the lifetime of signing capability for fog nodes, an appropriate mechanism is crucial. In this article, the author proposes a time-constrained strong multi-designated verifier signature scheme to meet the above requirement. In particular, a conventional non-delegatable strong multi-designated verifier signature scheme with low computation is first given. Based on its constructions, we show how to transform it into a time-constrained variant. The unforgeability of the proposed schemes is formally proved based on the famous elliptic curve discrete logarithm assumption. The security requirement of strong signer ambiguity for our substantial constructions is also analyzed by utilizing the intractable assumption of decisional Diffie–Hellman. Moreover, some comparisons in terms of the signature size and computational costs for involved entities among related mechanisms are made.

Sign in / Sign up

Export Citation Format

Share Document