• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Shu Jian, Liang Changyong, Xu Jian. Trust-Based Multi-Objectives Task Assignment Model in Cloud Service System[J]. Journal of Computer Research and Development, 2018, 55(6): 1167-1179. DOI: 10.7544/issn1000-1239.2018.20170404
Citation: Shu Jian, Liang Changyong, Xu Jian. Trust-Based Multi-Objectives Task Assignment Model in Cloud Service System[J]. Journal of Computer Research and Development, 2018, 55(6): 1167-1179. DOI: 10.7544/issn1000-1239.2018.20170404

Trust-Based Multi-Objectives Task Assignment Model in Cloud Service System

More Information
  • Published Date: May 31, 2018
  • Cloud computing with other emerging information technologies promotes the transformation and upgrading of the service industry. The new mode of cloud service brings the convenience and agility by the remote service and on-demand use. Meanwhile, it also expands the existing information security boundary, trigging new security problems. Trust mechanism provides a good solution for the security problem of cloud service. This paper builds a service-oriented architecture of task assigning system in the cloud environment. It introduces the trust mechanism into cloud services by measuring the trust requirement of tasks and the trust degree of service resources. Considering the execution time, cost and trust as optimization objectives, we propose a business process driven multi-objective task assignment model in the cloud service system. Some typical structures: sequence, parallel, parallel-AND, parallel-OR, parallel-XOR, simple loop and combined loop are introduced to represent the functions of business process structures. The three objectives are set to keep security and trust of the system based on high efficiency and low cost. An improved strength Pareto genetic algorithm 2 (SPGA2) with the local search strategy is proposed to improve the search efficiency of solution space in multi-objective task assignment problem. Finally, simulation experiments verify the availability of the model and the superiority of the algorithm.
  • Related Articles

    [1]Xia Qing, Li Shuai, Hao Aimin, Zhao Qinping. Deep Learning for Digital Geometry Processing and Analysis: A Review[J]. Journal of Computer Research and Development, 2019, 56(1): 155-182. DOI: 10.7544/issn1000-1239.2019.20180709
    [2]Xu Xiao, Ding Shifei, Sun Tongfeng, Liao Hongmei. Large-Scale Density Peaks Clustering Algorithm Based on Grid Screening[J]. Journal of Computer Research and Development, 2018, 55(11): 2419-2429. DOI: 10.7544/issn1000-1239.2018.20170227
    [3]Sun Yong, Tan Wenan, Jin Ting, Zhou Liangguang. A Collaborative Collusion Detection Method Based on Online Clustering[J]. Journal of Computer Research and Development, 2018, 55(6): 1320-1332. DOI: 10.7544/issn1000-1239.2018.20170231
    [4]Xu Kai, Wu Xiaojun, Yin Hefeng. Distributed Low Rank Representation-Based Subspace Clustering Algorithm[J]. Journal of Computer Research and Development, 2016, 53(7): 1605-1611. DOI: 10.7544/issn1000-1239.2016.20148362
    [5]Zhang Shuai, Li Tao, Jiao Xiaofan, Wang Yifeng, Yang Yulu. Parallel TNN Spectral Clustering Algorithm in CPU-GPU Heterogeneous Computing Environment[J]. Journal of Computer Research and Development, 2015, 52(11): 2555-2567. DOI: 10.7544/issn1000-1239.2015.20148151
    [6]Zhu Hong, Ding Shifei, Xu Xinzheng. An AP Clustering Algorithm of Fine-Grain Parallelism Based on Improved Attribute Reduction[J]. Journal of Computer Research and Development, 2012, 49(12): 2638-2644.
    [7]Lu Weiming, Du Chenyang, Wei Baogang, Shen Chunhui, and Ye Zhenchao. Distributed Affinity Propagation Clustering Based on MapReduce[J]. Journal of Computer Research and Development, 2012, 49(8): 1762-1772.
    [8]Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
    [9]Luo Xiaonan, Lin Mouguang, Ji Changbo, and Li Zhiyong. A Progressive Geometry Simplification Method for Mobile Computing Terminal[J]. Journal of Computer Research and Development, 2007, 44(6): 1038-1043.
    [10]Ou Xinliang, Chen Songqiao, Chang Zhiming. A Parallel Geometric Correction Algorithm Based on Dynamic Division-Point Computing[J]. Journal of Computer Research and Development, 2006, 43(6): 1115-1121.

Catalog

    Article views (1395) PDF downloads (538) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return