Guo P.,Chongqing University |
Guo P.,Chongqing Key Laboratory of Software Theory & Technology |
Ning L.-J.,Chongqing University
Tongxin Xuebao/Journal on Communications | Year: 2014
The data locality is divided into two levels. One is called the node data locality, which placing tasks on nodes that contain their input data. The other one is called the rack data locality, which placing tasks on nodes whose rack contains their input data. A new scheduling strategy called DDRF is proposed which combines the DRF and the delay. The DDRF is not only able to meet high locality but also achieve fairness. In the DDRF, the simulation results show the influence on the efficiency of jobs' implement. ©, 2014, Editorial Board of Journal on Communications. All right reserved.
Jian X.,Chongqing University |
Jian X.,Chongqing Key Laboratory of Software Theory & Technology |
Zhu Q.,Chongqing University |
Zhu Q.,Chongqing Key Laboratory of Software Theory & Technology |
And 4 more authors.
Journal of Computational Information Systems | Year: 2015
With the development in the utilization of cloud computing, more and more constitutive Web Services (WSs) which providing identical functionalities but differing in quality characteristics are published on the web. QoS-aware service composition which only consider the "promised" Quality of Service (QoS) declared by service provider would not appropriate in dynamic cloud environment and would leads to composition failure. In this paper, we propose a soft constrained QoS uncertainty-aware service composition approach which takes the advantage of historical QoS records rather than using the tentative QoS values. A novel QoS interval model and a possibility theory based soft constraint mechanism are used to tackle the problem of uncertainty and attain a trade-off between QoS requirements and a feasible composition. The experimental results show that our approach can conduct service composition with effectiveness and efficiency. © 2015 by Binary Information Press.