An enhanced parallel processing algorithm based on TOP-K decomposition of hypercube model

被引:0
|
作者
Zhang Q. [1 ,2 ]
Feng Y. [1 ]
Qiang B.-H. [3 ,4 ]
Li Y. [2 ]
机构
[1] Chongqing University, Chongqing
[2] Xuchang University, Xuchang
[3] Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin
[4] Guangxi Key Laboratory of Optoelectronic Information Processing, Guilin University of Electronic Technology, Guilin
基金
中国国家自然科学基金;
关键词
Hypercube model; Parallel processing; TOP-K decomposition;
D O I
10.1504/IJADS.2022.121557
中图分类号
学科分类号
摘要
Parallel processing technology has been widely used in many fields. We will discuss the technology of large-scale data parallel computing based on network. The parallel processing method based on hypercube model could divide large-scale data into a large number of sub-datasets, which will be distributed to each processing unit. But empty hypercube units existed because of uneven segmentation. To solve this question, an enhanced parallel processing algorithm based on TOP-K (it is equal to selecting the kth data from the ordered data) decomposition of hypercube model was proposed to evenly divide large-scale data in parallel processing. Experiment result shows that the proposed algorithm has some enhancement on time complexity, scalability and speedup in contrast with the parallel processing method based on hypercube model. Copyright © 2022 Inderscience Enterprises Ltd.
引用
收藏
页码:143 / 155
页数:12
相关论文
共 50 条
  • [21] FastTopK: A Fast Top-K Trajectory Similarity Query Processing Algorithm for GPUs
    Mustafa, Hamza
    Leal, Eleazar
    Gruenwald, Le
    2018 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2018, : 542 - 547
  • [22] Top-k Query Processing with Conditional Skips
    Bortnikov, Edward
    Carmel, David
    Golan-Gueta, Guy
    WWW'17 COMPANION: PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, 2017, : 653 - 661
  • [23] Processing top-k queries from samples
    Cohen, Edith
    Grossaug, Nadav
    Kaplan, Haim
    COMPUTER NETWORKS, 2008, 52 (14) : 2605 - 2622
  • [24] Efficient Processing of Top-k Joins in MapReduce
    Saouk, Mei
    Doulkeridis, Christos
    Vlachou, Akrivi
    Norvag, Kjetil
    2016 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2016, : 570 - 577
  • [25] Efficient processing of distributed top-k queries
    Yu, HL
    Li, HG
    Wu, P
    Agrawal, D
    El Abbadi, A
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2005, 3588 : 65 - 74
  • [26] Adaptive processing of top-k queries in XML
    Marian, A
    Amer-Yahia, S
    Koudas, N
    Srivastava, D
    ICDE 2005: 21ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2005, : 162 - +
  • [27] A SURVEY ON TOP-K QUERY PROCESSING IN MANETs
    Mohanapriya, T.
    Ranganathan, S. Raja
    Karthik, S.
    PROCEEDINGS OF 2017 11TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND CONTROL (ISCO 2017), 2017, : 480 - 484
  • [28] Top-k query processing in uncertain Databases
    Soliman, Mohamed A.
    Ilyas, Ihab F.
    Chang, Kevin Chen-Chuan
    2007 IEEE 23RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2007, : 871 - +
  • [29] Processing and Notifying Range Top-k Subscriptions
    Yu, Albert
    Agarwal, Pankaj K.
    Yang, Jun
    2012 IEEE 28TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2012, : 810 - 821
  • [30] Efficient Processing of Reverse Top-k Dominating Queries
    Jiang, Tao
    Zhang, Bin
    Yang, Jun
    PROCEEDINGS OF 2018 THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE (CSAI 2018) / 2018 THE 10TH INTERNATIONAL CONFERENCE ON INFORMATION AND MULTIMEDIA TECHNOLOGY (ICIMT 2018), 2018, : 115 - 119