parallel physics-凯发网

the load rebalancing problem (lrp) that reassigns tasks to processors so as to minimize the maximum load arises in the context of dynamic load balancing. many applications such as on web based environment, parallel computing on clusters can be stated as lrp. solving lrp successfully would allow us to utilize resources better and achieve better performance. however lrp has been proven to be np-hard, thus generating the exact solutions in tractable amount of time becomes infeasible when the problems become large. we present a new nature-inspired approximation algorithm based on the waterflow particle mechanics (w-pm) model to compute in parallel approximate efficient solutions for lrps. just like other nature-inspired algorithms (nas) drawing from observations of physical processes that occur in nature, the w-pm algorithm is inspired by kinematics and dynamics of waterflow. the w-pm algorithm maps the classical lrp to the flow of water flows in channels by corresponding mathematical model in which all water flows flow according to certain defined rules until reaching a stable state. by anti-mapping the stable state, the solution to lrp can be obtained.