Learn More
Particle swarm optimization (PSO) is an evolutionary algorithm known for its simplicity and effectiveness in solving various optimization problems. PSO should have strong yet balanced exploration and exploitation capabilities to enhance its performance. A superior solution guided PSO (SSG-PSO) framework integrated with an individual level based mutation(More)
Nowadays, providing quality of service (QoS) guarantees for some applications such as signal data processing has become a critical issue. In this paper, we propose a novel self-adaptive QoS-aware scheduling algorithm called SAQA that sufficiently considers the adaptability for real-time tasks with QoS demands on heterogeneous clusters. When the system is in(More)
Efficient scheduling is of great significance to rationally make use of scarce satellite resources. Task clustering has been demonstrated to realize an effective strategy to improve the efficiency of satellite scheduling. However, the previous task clustering strategy is static. That is, it is integrated into the scheduling in a two-phase manner rather than(More)
Discovering and utilizing problem domain knowledge is a promising direction towards improving the efficiency of evolutionary algorithms (EAs) when solving optimization problems. We propose a knowledge-based variable reduction strategy (VRS) that can be integrated into EAs to solve unconstrained and first-order derivative optimization functions more(More)
Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems. Although many scheduling algorithms have been proposed, emergency tasks, characterized as importance and urgency (e.g., observation tasks orienting to the earthquake area and military conflict area), have not been taken into account yet.(More)
Although Particle Swarm Optimization (PSO) has demonstrated competitive performance in solving global optimization problems, it exhibits some limitations when dealing with optimization problems with high dimensionality and complex landscape. In this paper, we integrate some problem-oriented knowledge into the design of a certain PSO variant. The resulting(More)
Currently, most tasks submitted to earth observation satellites (EOSs) are with deadlines, to satisfy users' timing requirements. Especially, in emergency, the timing needs are more apparent. Unfortunately, traditional scheduling algorithms do not efficiently deal with this issue. Hence, it is nontrivial to propose a real-time scheduling algorithm for(More)
Fault-tolerant scheduling, effective means of improving system reliability, plays a significant role in some mission-critical applications. Although extensive fault-tolerant scheduling algorithms have been proposed for real-time tasks in distributed systems, quality of service (QoS) requirements demanded by mission-critical tasks have not been taken into(More)
Currently, most tasks submitted to earth observation satellites (EOSs) are with deadlines, to satisfy users’ timing requirements. Besides, tasks are normally submitted dynamically, with uncertainties of tasks number and submission times. In this paper, we establish a multi-objective mathematic programming model for dynamic real-time scheduling of EOSs. To(More)