Wei-Wei Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wei-Wei Lin has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Deyu Qi
School of Computer Engineering and Science, South China Univ. of Tech., Guangzhou Guangdong, 510640, China
2 shared publications Chen Liang
School of Computer Engineering and Science South China University of Technology Guangzhou China
1 shared publicationJames Z. Wang
School of Computing Clemson University PO Box 340974 Clemson SC 29634‐0974 USA
1 shared publicationRajkumar Buyya
Cloud Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering The University of Melbourne Parkville Victoria Australia
1 shared publication
Latest Publications
- 23 November 2012
- Published by Wiley in Software: Practice and Experience
- Vol. 44 (2) , 163-174
Bandwidth‐aware divisible task scheduling for cloud computing
SUMMARY: Task scheduling is a fundamental issue in achieving high efficiency in cloud computing. However, it is a big challenge for efficient scheduling algorithm design and implementation (as general scheduling problem is NP‐complete). Most existing task‐scheduling methods of cloud computing only consider task resource requirements for CPU and memory, without considering bandwidth requirements. In order to obtain better performance, in this paper, we propose a bandwidth‐aware algorithm for divisible task scheduling in cloud‐computing environments. A nonlinear programming model for the divisible task‐scheduling problem under the bounded multi‐port model is presented. By solving this model, the optimized allocation scheme that determines proper number of tasks assigned to each virtual resource node is obtained. On the basis of the optimized allocation scheme, a heuristic algorithm for divisible load scheduling, called bandwidth‐aware task‐scheduling (BATS) algorithm, is proposed. The performance of algorithm is evaluated using CloudSim toolkit. Experimental result shows that, compared with the fair‐based task‐scheduling algorithm, the bandwidth‐only task‐scheduling algorithm, and the computation‐only task‐scheduling algorithm, the proposed algorithm (BATS) has better performance. Copyright © 2012 John Wiley & Sons, Ltd.
- 23 November 2012
- Published by Wiley in Software: Practice and Experience
- Vol. 44 (2) , 163-174
Bandwidth‐aware divisible task scheduling for cloud computing
SUMMARY: Task scheduling is a fundamental issue in achieving high efficiency in cloud computing. However, it is a big challenge for efficient scheduling algorithm design and implementation (as general scheduling problem is NP‐complete). Most existing task‐scheduling methods of cloud computing only consider task resource requirements for CPU and memory, without considering bandwidth requirements. In order to obtain better performance, in this paper, we propose a bandwidth‐aware algorithm for divisible task scheduling in cloud‐computing environments. A nonlinear programming model for the divisible task‐scheduling problem under the bounded multi‐port model is presented. By solving this model, the optimized allocation scheme that determines proper number of tasks assigned to each virtual resource node is obtained. On the basis of the optimized allocation scheme, a heuristic algorithm for divisible load scheduling, called bandwidth‐aware task‐scheduling (BATS) algorithm, is proposed. The performance of algorithm is evaluated using CloudSim toolkit. Experimental result shows that, compared with the fair‐based task‐scheduling algorithm, the bandwidth‐only task‐scheduling algorithm, and the computation‐only task‐scheduling algorithm, the proposed algorithm (BATS) has better performance. Copyright © 2012 John Wiley & Sons, Ltd.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1561-1565
Research and Implementation Issues of Fusegrid
After analyzing problems in current grid environments, a new grid architecture (called FuseGrid) based on the tree-shaped fusion of resources is presented in this paper. JVMs act as a base computing resources in the proposed grid architecture, in which all objects that can be accessed by computer systems are regarded as resources and they are aggregated and fused in the form of tree from bottom to top, forming new resources of higher level. After introducing an overview of FuseGrid and discussing its functionality model, the key issues of FuseGrid implementation, the algorithms for tree building, dynamic reconfiguring tree and resource searching are presented in this paper. Then, it focuses on the task allocation algorithm using dynamic load balancing for large-scale applications in FuseGrid. Finally, the experiments show that FuseGrid has excellent performance when it is used as an execution environment of large batch of Java applications
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1561-1565
Research and Implementation Issues of Fusegrid
After analyzing problems in current grid environments, a new grid architecture (called FuseGrid) based on the tree-shaped fusion of resources is presented in this paper. JVMs act as a base computing resources in the proposed grid architecture, in which all objects that can be accessed by computer systems are regarded as resources and they are aggregated and fused in the form of tree from bottom to top, forming new resources of higher level. After introducing an overview of FuseGrid and discussing its functionality model, the key issues of FuseGrid implementation, the algorithms for tree building, dynamic reconfiguring tree and resource searching are presented in this paper. Then, it focuses on the task allocation algorithm using dynamic load balancing for large-scale applications in FuseGrid. Finally, the experiments show that FuseGrid has excellent performance when it is used as an execution environment of large batch of Java applications
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 2160133X,p. 4389-4394
Research and Implementation Issues of Fusegrid
After analyzing problems in current grid environments, a new grid architecture(called FuseGrid) based on the tree-shaped fusion of resources is presented in this paper. JVMs act as a base computing resources in the proposed grid architecture, in which all objects that can be accessed by computer systems are regarded as resources and they are aggregated and fused in the form of tree from bottom to top, forming new resources of higher level. After introducing an overview of FuseGrid and discussing its functionality model, the key issues of FuseGrid implementation, the algorithms for tree building, dynamic reconfiguring tree and resource searching are presented in this paper. Then, it focuses on the task allocation algorithm using dynamic load balancing for large-scale applications in FuseGrid. Finally, the experiments show that FuseGrid has excellent performance when it is used as an execution environment of large batch of Java applications.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 2160133X,p. 4389-4394
Research and Implementation Issues of Fusegrid
After analyzing problems in current grid environments, a new grid architecture(called FuseGrid) based on the tree-shaped fusion of resources is presented in this paper. JVMs act as a base computing resources in the proposed grid architecture, in which all objects that can be accessed by computer systems are regarded as resources and they are aggregated and fused in the form of tree from bottom to top, forming new resources of higher level. After introducing an overview of FuseGrid and discussing its functionality model, the key issues of FuseGrid implementation, the algorithms for tree building, dynamic reconfiguring tree and resource searching are presented in this paper. Then, it focuses on the task allocation algorithm using dynamic load balancing for large-scale applications in FuseGrid. Finally, the experiments show that FuseGrid has excellent performance when it is used as an execution environment of large batch of Java applications.