<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>One definition of the word “distributed system” describes it as “a set of entities that collaborate in order to find a solution to a problem that cannot be solved by a single entity using their own resources.” This description of a distributed system is an example of a distributed system. As the number of algorithms that are mathematically complicated continues to increase, distributed computing systems have emerged as a direct result of this trend. The optimization of a distributed computing system has been accomplished via the development of methods for the distribution of work and the scheduling of jobs. Because of this, the system has been able to be used in a more efficient manner. Task scheduling refers to the process of selecting the order in which actions are carried out in response to a given set of circumstances. On the other hand, task allocation is the process of allocating tasks to the processors in a system that are the most fit for taking on those tasks. This procedure determines which processors are assigned the jobs. Within the context of distributed systems, the objective of this article is to provide a detailed review of the several approaches to task scheduling that have been used by researchers.</p>
</abstract>

One definition of the word “distributed system” describes it as “a set of entities that collaborate in order to find a solution to a problem that cannot be solved by a single entity using their own resources.” This description of a distributed system is an example of a distributed system. As the number of algorithms that are mathematically complicated continues to increase, distributed computing systems have emerged as a direct result of this trend. The optimization of a distributed computing system has been accomplished via the development of methods for the distribution of work and the scheduling of jobs. Because of this, the system has been able to be used in a more efficient manner. Task scheduling refers to the process of selecting the order in which actions are carried out in response to a given set of circumstances. On the other hand, task allocation is the process of allocating tasks to the processors in a system that are the most fit for taking on those tasks. This procedure determines which processors are assigned the jobs. Within the context of distributed systems, the objective of this article is to provide a detailed review of the several approaches to task scheduling that have been used by researchers.

Web Technology Grounded Effects of Task Scheduling in Distributed and Cloud Systems

Technical College of Informatics, Akre University for Applied Sciences

ITM Dept., Technical College of Adminstration

Journal of Smart Internet of Things

This work is licensed under the Creative Commons Attribution 4.0 International License.

One definition of the word “distributed system” describes it as “a set of entities that collaborate in order to find a solution to a problem that cannot be...

Web Technology Grounded Effects of Task Scheduling in Distributed and Cloud Systems

Pubblicato online: 15 dic 2022

Pagine: 196 - 218

Ricevuto: 01 set 2022

Accettato: 07 nov 2022

DOI: https://doi.org/10.2478/jsiot-2022-0013

Parole chiave
Web Technology, Task Scheduling, Distributed System, Cloud Computing

© 2022 Halbast Rasheed Ismael et al., published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Web Technology Grounded Effects of Task Scheduling in Distributed and Cloud Systems

Pubblicato online: 15 dic 2022

Pagine: 196 - 218

Ricevuto: 01 set 2022

Accettato: 07 nov 2022

DOI: https://doi.org/10.2478/jsiot-2022-0013

Parole chiaveWeb Technology, Task Scheduling, Distributed System, Cloud Computing

© 2022 Halbast Rasheed Ismael et al., published by Sciendo

This work is licensed under the Creative Commons Attribution 4.0 International License.

Parole chiave
Web Technology, Task Scheduling, Distributed System, Cloud Computing