Emmanuel BugingoYingsheng QinJuntao WangDefu ZhangWei Zheng
Summary Nowadays, cloud service providers usually offer users virtual machines with various combinations of configurations and prices. As this new service scheme emerges, the problem of choosing the cost‐minimized combination under a deadline constraint is becoming more complex for users. The complexity of determining the cost‐minimized combination may be resulted from different causes: the characteristics of user applications and providers' setting on the configurations and pricing of virtual machine. In this paper, we proposed an algorithm with two variants to help the users to schedule their workflow applications on clouds so that the cost can be minimized and the deadline constraints can be satisfied. The proposed algorithm is evaluated by extensive simulation experiments with two realistic workflows.
Quanwang WuFuyuki IshikawaQingsheng ZhuYunni XiaJunhao Wen
Zengpeng LiHuiqun YuGuisheng Fan
Bing LinWenzhong GuoGuolong ChenNaixue XiongRongrong Li
Ruben Van den BosscheKurt VanmechelenJ. Broeckhove
Vahid ArabnejadKris Bubendorfer