Cost-efficient parallel processing of irregularly structured problems in cloud computing environments

被引:0
作者
Jens Haussmann
Wolfgang Blochinger
Wolfgang Kuechlin
机构
[1] Reutlingen University,Parallel and Distributed Computing Group
[2] University of Tuebingen,Symbolic Computation Group
来源
Cluster Computing | 2019年 / 22卷
关键词
High performance distributed computing; Cloud computing; Parallel computing; Cost model; Irregularly structured problems;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we deal with optimizing the monetary costs of executing parallel applications in cloud-based environments. Specifically, we investigate on how scalability characteristics of parallel applications impact the total costs of computations. We focus on a specific class of irregularly structured problems, where the scalability typically depends on the input data. Consequently, dynamic optimization methods are required for minimizing the costs of computation. For quantifying the total monetary costs of individual parallel computations, the paper presents a cost model that considers the costs for the parallel infrastructure employed as well as the costs caused by delayed results. We discuss a method for dynamically finding the number of processors for which the total costs based on our cost model are minimal. Our extensive experimental evaluation gives detailed insights into the performance characteristics of our approach.
引用
收藏
页码:887 / 909
页数:22
相关论文
共 42 条
  • [1] Blochinger W(2003)Parallel propositional satisfiability checking with distributed dynamic learning Parallel Comput. 29 969-994
  • [2] Sinz C(2001)Planning as heuristic search Artif. Intell. 129 5-33
  • [3] Küchlin W(2016)AutoElastic: automatic resource elasticity for high performance applications in the cloud IEEE Trans. Cloud Comput. 4 6-19
  • [4] Bonet B(2018)A lightweight plug-and-play elasticity service for self-organizing resource provisioning on parallel applications Fut. Gen. Comput. Syst. 78 176-190
  • [5] Geffner H(1999)Ant algorithms for discrete optimization Artif. Life 5 137-172
  • [6] Da Rosa Righi R(1999)State of the art in parallel search techniques for discrete optimization problems IEEE Trans. Knowl. Data Eng. 11 28-35
  • [7] Rodrigues VF(2001)LAO*: a heuristic search algorithm that finds solutions with loops Artif. Intell. 129 35-62
  • [8] Da Costa CA(1953)Sequential minimax search for a maximum Proc. Am. Math. Soc. 4 502-506
  • [9] Galante G(2013)High performance cloud computing Fut. Gen. Comput. Syst. 29 1408-1416
  • [10] De Bona LCE(2000)Aggregate objective functions and pareto frontiers: required relationships and practical implications Optim. Eng. 1 171-188