Bulletin of Electrical Engineering and Informatics, Jan 31, 2024
Networks consist of numerous resources; it is crucial not to overlook fault tolerance and conside... more Networks consist of numerous resources; it is crucial not to overlook fault tolerance and consider it during planning. This is because errors during implementation can result in wasted time and effort, thereby squandering these resources. One solution to address this issue effectively is to implement the task on multiple resources to minimize the occurrence of failed tasks. However, employing an unspecified or fixed number of resources can lead to the depletion of network resources and the overall failure of the network. Replication plays a pivotal role in enhancing data availability in distributed systems. By storing data in multiple locations, users can still access it even if some copies are unavailable due to site failure. Many replication-based algorithms utilize a predetermined number of iterations per function, which may consume excessive network resources, even if the ongoing task does not require such abundant resources. This paper proposes task replication as a viable mechanism for an efficient and fault-tolerant scheduling system. We introduce an algorithm that dynamically selects the optimal and minimal number of replicas based on the network's failure history. This approach aims to minimize the failure rate during task execution.
Bulletin of Electrical Engineering and Informatics
Johnson's rule is a scheduling method for the sequence of jobs. Its primary goal is to find t... more Johnson's rule is a scheduling method for the sequence of jobs. Its primary goal is to find the perfect sequence of functions to reduce the amount of idle time, and it also reduces the total time required to complete all functions. It is a suitable method for scheduling the purposes of two functions in a specific time-dependent sequence for both functions and where the time factor is the only parameter used in this way. Therefore, it is not suitable for scheduling work for computers network, where there are many factors affecting the completion time such as CPU speed, memory, bandwidth, and size of data. In this research, Johnson's method will adopt by adding many factors that affect the completion time of the work so that it becomes suitable for the site’s job scheduling purposes to reduce the waiting and idle time for a group of jobs.
Bulletin of Electrical Engineering and Informatics, Jan 31, 2024
Networks consist of numerous resources; it is crucial not to overlook fault tolerance and conside... more Networks consist of numerous resources; it is crucial not to overlook fault tolerance and consider it during planning. This is because errors during implementation can result in wasted time and effort, thereby squandering these resources. One solution to address this issue effectively is to implement the task on multiple resources to minimize the occurrence of failed tasks. However, employing an unspecified or fixed number of resources can lead to the depletion of network resources and the overall failure of the network. Replication plays a pivotal role in enhancing data availability in distributed systems. By storing data in multiple locations, users can still access it even if some copies are unavailable due to site failure. Many replication-based algorithms utilize a predetermined number of iterations per function, which may consume excessive network resources, even if the ongoing task does not require such abundant resources. This paper proposes task replication as a viable mechanism for an efficient and fault-tolerant scheduling system. We introduce an algorithm that dynamically selects the optimal and minimal number of replicas based on the network's failure history. This approach aims to minimize the failure rate during task execution.
Bulletin of Electrical Engineering and Informatics
Johnson's rule is a scheduling method for the sequence of jobs. Its primary goal is to find t... more Johnson's rule is a scheduling method for the sequence of jobs. Its primary goal is to find the perfect sequence of functions to reduce the amount of idle time, and it also reduces the total time required to complete all functions. It is a suitable method for scheduling the purposes of two functions in a specific time-dependent sequence for both functions and where the time factor is the only parameter used in this way. Therefore, it is not suitable for scheduling work for computers network, where there are many factors affecting the completion time such as CPU speed, memory, bandwidth, and size of data. In this research, Johnson's method will adopt by adding many factors that affect the completion time of the work so that it becomes suitable for the site’s job scheduling purposes to reduce the waiting and idle time for a group of jobs.
Uploads
Papers by Mahdi Almhanna