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
来源：
International Journal of Applied Decision Sciences | 2022年 / 15卷 / 02期
基金：
中国国家自然科学基金;
关键词：
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 条
  • [41] Interval-Based Pruning for Top-k Processing over Compressed Lists
    Chakrabarti, Kaushik
    Chaudhuri, Surajit
    Ganti, Venkatesh
    IEEE 27TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2011), 2011, : 709 - 720
  • [42] Skyline-based peer-to-peer top-k query processing
    Vlachou, Akrivi
    Doulkeridis, Christos
    Norvag, Kjetil
    Vazirgiannis, Michalis
    2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, : 1421 - +
  • [43] DC-Top-k: A Novel Top-k Selecting Algorithm and Its Parallelization
    Xue, Zhengyuan
    Li, Ruixuan
    Zhang, Heng
    Gu, Xiwu
    Xu, Zhiyong
    PROCEEDINGS 45TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING - ICPP 2016, 2016, : 370 - 379
  • [44] PBSM: An Effcient Top-K Subgraph Matching Algorithm
    Chen, Wei
    Liu, Jia
    Chen, Ziyang
    Tang, Xian
    Li, Kaiyu
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2018, 32 (06)
  • [45] FA*IR: A Fair Top-k Ranking Algorithm
    Zehlike, Meike
    Bonchi, Francesco
    Castillo, Carlos
    Hajian, Sara
    Megahed, Mohamed
    Baeza-Yates, Ricardo
    CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 1569 - 1578
  • [46] An algorithm for finding top-K valid XPath queries
    University of Tsukuba, Tsukuba, Ibaraki
    305-8550, Japan
    IPSJ Online Trans., 2014 (69-81):
  • [47] A Top-k query algorithm on uncertain streaming data
    Wang, Ying
    Yu, Jianqiao
    Journal of Computational Information Systems, 2013, 9 (13): : 5273 - 5279
  • [48] Fully Dynamic Algorithm for Top-k Densest Subgraphs
    Nasir, Muhammad Anis Uddin
    Gionis, Aristides
    Morales, Gianmarco De Francisci
    Girdzijauskas, Sarunas
    CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 1817 - 1826
  • [49] Scalable Top-K Query Processing Using Graphics Processing Unit
    Zhang, Yulin
    Fang, Hui
    Li, Xiaoming
    LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING, LCPC 2017, 2019, 11403 : 240 - 261
  • [50] Unbiased Top-k Learning to Rank with Causal Likelihood Decomposition
    Zhao, Haiyuan
    Xu, Jun
    Zhang, Xiao
    Cai, Guohao
    Dong, Zhenhua
    Wen, Ji-Rong
    ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL IN THE ASIA PACIFIC REGION, SIGIR-AP 2023, 2023, : 129 - 138
12345