- 期刊
Parallel Optimization for Data-Intensive Service Composition
並列摘要
The age of Big Data has inspired the appearance and application of data-intensive Web service. In most cases, multiple data-intensive services are assembled into a service composition to meet complicated requirements. As the number of Data-intensive Web services on the Internet is increasing rapidly and dramatically, traditional central service composition approaches have come to a performance bottleneck. This paper proposes a method for automatic data-intensive service composition, which can be executed in parallel. Firstly, the problem of automatic service composition is defined by combing the approaches of State Space Search and Planning Graph. Then, a heuristic algorithm is proposed to compose data-intensive Web service automatically. After that, more details are given to present the parallel optimization for the composition algorithm. A series of experiments show that the proposed parallel optimization method improves the efficiency of automatic Web service composition to a great extent.
延伸閱讀
- WU, A. C. H. (1997). Datapath Optimization Using Layout Information: An Empirical Study. VLSI Design, 1997(), 195-209. https://doi.org/10.1155/1997/85473
- Li, G. J. (2004). Using Constraint Programming To Solve Identical Parallel Machine Preemptive Scheduling [master's thesis, Tatung University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0081-0607200917234592
- 吳臺宜（2012）。Implementation of Parallel Computing FAST Algorithm on Mobile GPU〔碩士論文，淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2012.00933
- 洪晢為（2021）。Using Bit-Parallel Operations to Improve Exact String Matching Algorithms〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://doi.org/10.6837/ncnu202100273
- Liu, J. S., Huang, C. H., & Yang, D. L. (2005). Parallel Volume Rendering with Sparse Data Structures. Journal of Information Science and Engineering, 21(2), 327-339. https://doi.org/10.6688/JISE.2005.21.2.5