Are you Xianwen Hao?

Claim your profile

Publications (5)0 Total impact

  • Chapter: Task Migration Enabling Grid Workflow Application Rescheduling
    Xianwen Hao, Yu Dai, Bin Zhang, Tingwei Chen
    [show abstract] [hide abstract]
    ABSTRACT: This paper focuses on the task migration enabling grid workflow application rescheduling problem, presents a reduced task graph model, and implements a performance oriented rescheduling algorithm based on immune genetic algorithm. The experiment shows that, compared with Adaptive Heterogeneous Earliest Finish Time static rescheduling algorithm and the classical dynamic Max-Min scheduling algorithm, the performance advantage of the proposed rescheduling algorithm is obvious, on the one hand because of the performance contribution of global optimization and task migration, and on the other hand because of the efficiency contribution of task graph reduction and immune genetic algorithm’s convergent speed. It also shows that task migration improves grid application’s adaptability of dynamics further.
    04/2008: pages 130-135;
  • Conference Proceeding: A Dependent Tasks Scheduling Model in Grid.
    Tingwei Chen, Bin Zhang, Xianwen Hao
    Progress in WWW Research and Development, 10th Asia-Pacific Web Conference, APWeb 2008, Shenyang, China, April 26-28, 2008. Proceedings; 01/2008
  • Conference Proceeding: Task Scheduling in Grid Based on Particle Swarm Optimization
    Tingwei Chen, Bin Zhang, Xianwen Hao, Yu Dai
    [show abstract] [hide abstract]
    ABSTRACT: Task scheduling is one of the core steps to effectively exploit the capabilities of resources in the grid. The task scheduling problem is an NP-complete problem. This paper studied on the task scheduling problem in grid environment and proposed a task scheduling mechanism, which expressed each possible task scheduling scheme as a task-resource assignment graph (T-RAG) and thus mapped the task scheduling problem into a graph optimal selection problem. Moreover, in order to find the optimal solution quickly and accurately, a task scheduling algorithm based on particle swarm optimization (PSO) was proposed. This algorithm regards the longest path of the task-resource assignment graph as fitness value and encodes every task-resource assignment as a particle. Finally, the experimentation shows that the approach proposed in this paper is effective to solve task scheduling problem
    Parallel and Distributed Computing, 2006. ISPDC '06. The Fifth International Symposium on; 08/2006
  • Conference Proceeding: QoS-Driven Grid Resource Selection Based on Novel Neural Networks.
    Advances in Grid and Pervasive Computing, First International Conference, GPC 2006, Taichung, Taiwan, May 3-5, 2006, Proceedings; 01/2006
  • Source
    Conference Proceeding: A Grid Resource Discovery Method under the Circumstances of Heterogeneous Ontologies.
    2005 International Conference on Semantics, Knowledge and Grid (SKG 2005), 27-29 November 2005, Beijing, China; 01/2005