In this paper, we present a framework for implementing the popular round robin scheduling algorithm, which is widely used in operating systems due to its simplicity and fairness among processes. Despite its widespread...
详细信息
With the flourishment of Internet technology, cloud computing has become the most expedient way to get tasks done without purchasing costly machines. From small businesses to well-established organizations are all ava...
详细信息
In the context of heterogeneous distributed systems like modern High-Performnace Computing (HPC) that must respond to unpredictable requests of variable complexity with variable resource requirements (processing power...
详细信息
The paper shows that load balancing with percentage load conversion, improves the performance of basic scheduling algorithm as FCFS (First Come-First Serve), EDF (Earliest Deadline First) in Grid *** conversion is the...
详细信息
The 5th Generation mobile system was featured as ultra-reliable and low-latency communications, which could support applications for industrial verticals. However, as to industrial control scenarios, it was necessary ...
详细信息
As the development of innovative automotive software continues to progress, the architecture and solutions required for automotive software become more complex. It is challenging to cope with these issues with a singl...
详细信息
Through the advancement of the Internet of Things (IoT), the development of devices for task automation, data extraction, and communication between devices has become increasingly easy. But as a result, tens of zettab...
详细信息
Over the last recent years, applications related to the internet of things have become the most important techniques in the world that facilitate interactions among humans and things to enhance the quality of life. So...
详细信息
Over the last recent years, applications related to the internet of things have become the most important techniques in the world that facilitate interactions among humans and things to enhance the quality of life. So, the number of devices used in these applications will increase, leading to the creation of huge amounts of data. Cisco proposed fog computing in 2012, which located between the end-users (Internet of Things devices) and cloud computing. Fog computing is not a replacement for cloud computing, but it reduces the drawbacks of cloud computing, makes it efficient and provides storage and computing services at the edge of the internet. Resource management is the key factor that decides the performance of fog computing. Whereas scheduling plays an important role in managing resources in fog computing, task scheduling is the ability to map tasks to the appropriate resources in fog computing. The task is a small part of a work that must be performed within a specific time. Because fog computing contains heterogeneous and distributed resources, task scheduling becomes complex. Task scheduling is an NP-hard problem that needs to apply effective task scheduling strategies to reach an ideal solution. There were many proposed algorithms about scheduling in the previous years;most of them were applied in cloud computing, while the minority were applied in fog computing. This paper aims to comprehensively review and analyze the most important up-to-date scheduling algorithms in fog computing. (C) 2021 The Authors. Published by Atlantis Press B.V.
In this paper, we deal with the regularity of status updates in a monitoring system. Specifically, we consider a system consisting of independent energy harvesting nodes with adaptive modulation capabilities that tran...
详细信息
ISBN:
(纸本)9781665486156
In this paper, we deal with the regularity of status updates in a monitoring system. Specifically, we consider a system consisting of independent energy harvesting nodes with adaptive modulation capabilities that transmit status updates to a non energy harvesting sink over a fading channel. Due to the randomness of the energy arrival and the channel time variations, a node may have difficulties maintaining regular status updates. Hence, the objective of this work is to design scheduling algorithms that minimize the number of violations of inter-delivery time over a finite time horizon. An inter-delivery violation event occurs when the time duration between two consecutive status updates exceeds a given time limit. We focus on online modulation and power adaptation policies where the transmitting sensor node adjusts the M-ary modulation level and transmission power based on both the channel state and the battery level. Specifically, we propose both deterministic and randomized algorithms to efficiently solve the considered scheduling problem for the one-node system. Deterministic solutions were extended to the multi-node system. The numerical results show that the proposed algorithms realize significant gain in terms of violations events compared to the benchmark fixed modulation solutions.
The reliability and latency requirements of wireless sensor network-based smart grid communications are met in large part by MAC protocols. Developed by IEEE, time slotted channel hopping (TSCH), a method that is effe...
详细信息
The reliability and latency requirements of wireless sensor network-based smart grid communications are met in large part by MAC protocols. Developed by IEEE, time slotted channel hopping (TSCH), a method that is effective, dependable, and predictable. However, the TSCH standard does not enable mobility and does not offer any solution for scheduling, especially in IEEE 802.15.4 TSCH, the most recent generation of extremely dependable and low-power MAC protocols. Recently, MSU-TSCH a time-frequency communication schedule was proposed to provide mobility to TSCH. Despite its distinctive qualities, MSU-TSCH has the drawback of computing the TSCH schedule at each node independently of its traffic load, which can significantly increase the communication delay. Due to this limitation, MSU-TSCH is not suitable for some delay-sensitive smart grid applications. In this article, we provide an improved MSU-TSCH-based TSCH protocol, called Mobility-TSCH, that dynamically adjusts time slot assignments based on traffic volume and latency requirement. Moreover, the protocol Mobility-TSCH adapts to topology changes and supports mobility. Additionally, it optimizes time slot allocation by prioritizing nodes closest to the sink. The performance and evaluation analysis of Mobility-TSCH compared to the original MSU-TSCH, reveal that the communication delay is greatly reduced, decreases the average end-to-end latency, the high packet delivery ratio (PDR), Increase the performance of both metrics, parent connectivity ratio (PCR) and convergence time (CT), while maintaining a minimal overhead signaling.
暂无评论