Abstract:

Task scheduling techniques, playing an important role to system performance, are one of the key technology in parallel and distributed systems. In general, the task scheduling problem in largescale systems is a NP problem. The modern heuristic biological evolution algorithm is an effective method to find an approximate solution for NP problems. In this paper, a scheduling algorithm which applys particle swarm algorithms into availability grid dispatch systems is proposed. The performance of the algorithm is analysed in theory. The simulation results show that compared with the SSAC algorithm which is recently proposed, the proposed particle swarm optimization task scheduling algorithm can generate shorter makespan while conserving the same availability level.

Key words: parallel and distributed computing;heterogeneous system;task scheduling;availability;particle swarm optimization algorithm