标题:An Efficient Algorithm for Runtime Minimum Cost Data Storage and Regeneration for Business Process Management in Multiple Clouds
作者:Zhang, Junhua ;Yuan, Dong ;Cui, Lizhen ;Zhou, Bing Bing
通讯作者:Cui, Lizhen
作者机构:[Zhang, J] School of Computer Science and Technology, Shandong University, Jinan, China;[ Yuan, D] School of Information Technology, The University of 更多
会议名称:16th International Conference on Business Process Management, BPM International Workshops 2018
会议日期:9 September 2018 through 14 September 2018
来源:Lecture Notes in Business Information Processing
出版年:2019
卷:342
页码:348-360
DOI:10.1007/978-3-030-11641-5_28
关键词:Business process management; Cloud computing; Datasets storage and regeneration
摘要:The proliferation of cloud computing provides flexible ways for users to utilize cloud resources to cope with data complex applications, such as Business Process Management (BPM) System. In the BPM system, users may have various usage manner of the system, such as upload, generate, process, transfer, store, share or access variety kinds of data, and these data may be complex and very large in size. Due to the pas-as-you-go pricing model of cloud computing, improper usage of cloud resources will incur high cost for users. Hence, for a typical BPM system usage, data could be regenerated, transferred and stored with multiple clouds, a data storage, transfer and regeneration strategy is needed to reduce the cost on resource usage. The current state-of-art algorithm can find a strategy that achieves minimum data storage, transfer and computation cost, however, this approach has very high computation complexity and is neither efficient nor practical to be applied at runtime. In this paper, by thoroughly investigating the trade-off problem of resources utilization, we propose a Provenance Candidates Elimination algorithm, which can efficiently find the minimum cost strategy for data storage, transfer and regeneration. Through comprehensive experimental evaluation, we demonstrate that our approach can calculate the minimum cost strategy in milliseconds, which outperforms the exiting algorithm by 2 to 4 magnitudes. © 2019, Springer Nature Switzerland AG.
收录类别:EI;SCOPUS
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061382054&doi=10.1007%2f978-3-030-11641-5_28&partnerID=40&md5=0b458fb2c233f56f24e89ea76a7ab4fe
TOP