The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Scheduling heterogeneous tasks in a heterogeneous grid environment aims at effectively utilizing the resources and sharing the load among the available resources. Such a task assignment problem is NP-hard. This paper presents a Hybrid Particle Swarm Optimization - Genetic Algorithm (HPSO-GA) for solving the Task Assignment Problem. The novel Particle Swarm Optimization (PSO) implements GA operations...
The goal of grid computing is to aggregate the power of widely distributed resources. Considering that the probability of failure is great in such systems, fault tolerance has become a crucial area in computational grid. In this paper, we propose a new strategy named RFOH for fault tolerant job scheduling in computational grid. This strategy maintains the history of fault occurrence of resources in...
Grid computing allows one to unite pools of servers, storage systems, and networks from different domain with their specific management policies, into a single large system. The Grid Environment is dynamic and its domains act autonomously. Unfortunately, in such an environment failure may occur occasionally or a volatile host can delay the entire execution for a long period of time, which in turn...
This work mainly aims at the designs of the genetic algorithm based scheduling strategies by considering four different fault tolerance techniques in the grid environment, including retry, migration, checkpoint, replication. We also take into account the risk relationship between jobs and nodes to improve the system reliability in the scheduling algorithm. According to the simulation results, we can...
The scheduling problem for real-time tasks on multiprocessor is one of NP-hard problems. In fault-tolerant real-time systems, tasks have deadlines to be met in spite of the presence of fault. Many attempts such as classical algorithms and intelligent methods have been made to solve this problem. Primary-backup (PB) scheme is one of the most important classical algorithms that have been employed for...
Messages and tasks in networked control systems must be executed in certain order and finished before their deadline, and they run on different resources. Therefore, a novel fault-tolerant scheduling algorithm is presented in this paper. Firstly, a scheduling sequence (including messages, primary copies and backup copies) is designed in a sampling period. Then heuristic static algorithm for assigning...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.