Particle Swarm Approach to Scheduling Work-Flow Applications in Distributed Data-Intensive Computing Environments

The scheduling problem in distributed data-intensive computing environments has been an active research topic due to immense practical applications. In this paper, we model the scheduling problem for work-flow applications in distributed data-intensive computing environments (FDSP) and make an attempt to formulate and solve the problem using a particle swarm optimization approach. We illustrate the algorithm performance and trace its feasibility and effectiveness with the help of an example