OSPN: Optimal Service Provisioning with Negotiation for Bag-of-Tasks Applications

被引:0
|
作者
Wang, Xiaogang [1 ,2 ]
Cao, Jian [1 ,3 ]
Xiang, Yang [4 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, 800 Dong Chuan Rd, Shanghai 200240, Peoples R China
[2] Shanghai Dianji Univ, 690 Jiang Chuan Rd, Shanghai 200240, Peoples R China
[3] Shanghai Jiao Tong Univ, Shanghai Inst Adv Commun & Data Sci, 800 Dong Chuan Rd, Shanghai 200240, Peoples R China
[4] Swinburne Univ Technol, Sch Software & Elect Engn, John St, Hawthorn, Vic 3122, Australia
基金
中国国家自然科学基金;
关键词
Cloud computing; Pricing; Economics; Nash equilibrium; Computational modeling; Parallel pricing negotiation; service provisioning strategy profile; multi-cloud service selection; spot Instance; utility nash equilibrium; kuhn-tucher condition;
D O I
10.1109/TSC.2017.2787707
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud service selection is becoming more complex with the arrival of a large number of cloud providers offering various service packages on the market. These cloud service packages are generally provisioned by Spot, On-demand and Reserved Instances. Typically, a user's service requirements contain many independent sub-tasks (Bag-of-Tasks), and have budget limitations and additional constraints. To select reasonable cloud instances to run the user's sub-tasks, we propose a strategy, OSPN (Optimal Service Provisioning with Negotiation), to support the allocation of tasks to services offered by multi-cloud providers. OSPN consists of two phases: in the first phase, a one-to-many parallel Spot Instance pricing negotiation is applied; in the second phase, service provisioning strategy profiles on the three types of cloud instances are calculated. Specifically, the first phase employs an improved double auction in which the price and availability of providers' instances are taken into account; then the second phase gives the utility Nash equilibrium model and derives the optimal provisioning strategy profiles. The experimental results show that our service provisioning strategy is more cost-effective, namely, the most gains of both the user and providers in the changing scenes, and the least payments of the user than the existing relevant strategies.
引用
收藏
页码:193 / 206
页数:14
相关论文
共 50 条
  • [21] Fair scheduling of bag-of-tasks applications on large-scale platforms
    Celaya, Javier
    Arronategui, Unai
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2015, 49 : 28 - 44
  • [22] A framework for cloud-aware development of bag-of-tasks scientific applications
    De Benedictis, Alessandra
    Rak, Massimiliano
    Turtur, Mauro
    Villano, Umberto
    [J]. INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING, 2016, 7 (02) : 130 - 140
  • [23] Optimal schedules for cycle-stealing in a network of workstations with a bag-of-tasks workload
    Rosenberg, AL
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2002, 13 (02) : 179 - 191
  • [24] Bag-of-Tasks Applications Scheduling on Volunteer Desktop Grids with Adaptive Information Dissemination
    Kwan, Shun Kit
    Muppala, Jogesh K.
    [J]. IEEE LOCAL COMPUTER NETWORK CONFERENCE, 2010, : 544 - 551
  • [25] Improving scalability of Bag-of-Tasks applications running on master-slave platforms
    da Silva, Fabricio A. B.
    Senger, Hermes
    [J]. PARALLEL COMPUTING, 2009, 35 (02) : 57 - 71
  • [26] Non-Clairvoyant Assignment of Bag-of-Tasks Applications Across Multiple Clouds
    HoseinyFarahabady, M.
    Lee, Young Choon
    Zomaya, Albert Y.
    [J]. 2012 13TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS, AND TECHNOLOGIES (PDCAT 2012), 2012, : 423 - 428
  • [27] Requirement-Aware Scheduling of Bag-of-Tasks Applications on Grids with Dynamic Resilience
    Hu, Menglan
    Veeravalli, Bharadwaj
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (10) : 2108 - 2114
  • [28] Scheduling bag-of-tasks applications on hybrid clouds under due date constraints
    Zhang, Yi
    Zhou, Junlong
    Sun, Jin
    [J]. JOURNAL OF SYSTEMS ARCHITECTURE, 2019, 101
  • [29] BOUNDS ON THE SCALABILITY OF BAG-OF-TASKS APPLICATIONS RUNNING ON MASTER-SLAVE PLATFORMS
    Senger, Hermes
    Barbosa Da Silva, Fabricio Alves
    [J]. PARALLEL PROCESSING LETTERS, 2012, 22 (02)
  • [30] Cost minimization for bag-of-tasks workflows in a federation of clouds
    Somayeh Abdi
    Latif PourKarimi
    Mahmood Ahmadi
    Farzad Zargari
    [J]. The Journal of Supercomputing, 2018, 74 : 2801 - 2822