MANY-TASK COMPUTING ON MANY-CORE ARCHITECTURES

被引:0
|
作者
Valero-Lara, Pedro [1 ,2 ]
Nookala, Poornima [3 ]
Pelayo, Fernando L. [4 ]
Jansson, Johan [2 ,5 ]
Dimitropoulos, Serapheim [3 ]
Raicu, Ioan [3 ]
机构
[1] Univ Manchester, Manchester M13 9PL, Lancs, England
[2] BCAM, Bilbao, Spain
[3] IIT, Chicago, IL 60616 USA
[4] UCLM, Albacete, Spain
[5] KTH Royal Inst Technol, Stockholm, Sweden
来源
关键词
Parallel Computing; Multi-Task Computing; Many-Core; GPU; Intel Xeon Phi; CUDA; OpenMP;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Many-Task Computing (MTC) is a common scenario for multiple parallel systems, such as cluster, grids, cloud and supercomputers, but it is not so popular in shared memory parallel processors. In this sense and given the spectacular growth in performance and in number of cores integrated in many-core architectures, the study of MTC on such architectures is becoming more and more relevant. In this paper, authors present what are those programming mechanisms to take advantages of such massively parallel features for the particular target of MTC. Also, the hardware features of the two dominant many-core platforms (NVIDIA's GPUs and Intel Xeon Phi) are also analyzed for our specific framework. Given the important differences in terms of hardware and software in our two many-core platforms, we have considered different strategies based on CUDA (for GPUs) and OpenMP (for Intel Xeon Phi). We carried out several test cases based on an appropriate and widely studied problem for benchmarking as matrix multiplication. Essentially, this study consisted of comparing the time consumed for computing in parallel several tasks one by one (the whole computational resources are used just to compute one task at a time) with the time consumed for computing in parallel the same set of tasks simultaneously (the whole computational resources are used for computing the set of tasks at very same time). Finally, we compared both software-hardware scenarios to identify the most relevant computer features in each of our many-core architectures.
引用
收藏
页码:33 / 46
页数:14
相关论文
共 50 条
  • [1] Multi-core versus many-core computing for many-task Branch-and-Bound applied to big optimization problems
    Melab, N.
    Gmys, J.
    Mezmaz, M.
    Tuyttens, D.
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 82 : 472 - 481
  • [2] Middleware support for many-task computing
    Ioan Raicu
    Ian Foster
    Mike Wilde
    Zhao Zhang
    Kamil Iskra
    Peter Beckman
    Yong Zhao
    Alex Szalay
    Alok Choudhary
    Philip Little
    Christopher Moretti
    Amitabh Chaudhary
    Douglas Thain
    Cluster Computing, 2010, 13 : 291 - 314
  • [3] Middleware support for many-task computing
    Raicu, Ioan
    Foster, Ian
    Wilde, Mike
    Zhang, Zhao
    Iskra, Kamil
    Beckman, Peter
    Zhao, Yong
    Szalay, Alex
    Choudhary, Alok
    Little, Philip
    Moretti, Christopher
    Chaudhary, Amitabh
    Thain, Douglas
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2010, 13 (03): : 291 - 314
  • [4] Many-Task Computing for Grids and Supercomputers
    Raicu, Ioan
    Foster, Ian T.
    Zhao, Yong
    2008 WORKSHOP ON MANY-TASK COMPUTING ON GRIDS AND SUPERCOMPUTERS, 2008, : 57 - +
  • [5] A polyphase filter for many-core architectures
    Adamek, K.
    Novotny, J.
    Armour, W.
    ASTRONOMY AND COMPUTING, 2016, 16 : 1 - 16
  • [6] Challenges and opportunities in many-core computing
    Manferdelli, John L.
    Govindaraju, Naga K.
    Crall, Chris
    PROCEEDINGS OF THE IEEE, 2008, 96 (05) : 808 - 815
  • [7] Cashmere: Heterogeneous Many-Core Computing
    Hijma, Pieter
    Jacobs, Ceriel J. H.
    van Nieuwpoort, Rob V.
    Bal, Henri E.
    2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2015, : 135 - 145
  • [8] Performance Evaluation of OpenFOAM on Many-Core Architectures
    Brzobohaty, Tomas
    Riha, Lubomir
    Karasek, Tomas
    Kozubek, Tomas
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014), 2015, 1648
  • [9] Graph Reachability on Parallel Many-Core Architectures
    Quer, Stefano
    Calabrese, Andrea
    COMPUTATION, 2020, 8 (04) : 1 - 26
  • [10] A Compressive Sensing Algorithm for Many-Core Architectures
    Borghi, A.
    Darbon, J.
    Peyronnet, S.
    Chan, T. F.
    Osher, S.
    ADVANCES IN VISUAL COMPUTING, PT II, 2010, 6454 : 678 - 686