Parallel Computational Reconfiguration Based on a PGAS Model Parallel Computational Reconfiguration Based on a PGAS Model

    • Kentaro Hara Kentaro Hara
    • School of Information Science and Technology, The University of Tokyo School of Information Science and Technology, The University of Tokyo
    • Kenjiro Taura Kenjiro Taura
    • School of Information Science and Technology, The University of Tokyo School of Information Science and Technology, The University of Tokyo

Abstract

In order to improve the resource utilization of clusters and supercomputers and thus deliver application results to users faster, it is essential for a job scheduler to expand and shrink parallel computations flexibly. In order to enable the flexible job scheduling, the parallel computations have to be reconfigurable. With this motivation, this paper proposes, implements and evaluates DMI, a global-view-based PGAS framework that enables easy programming of reconfigurable and high-performance parallel iterative computations. DMI provides programming interfaces with which a programmer can program the reconfiguration easily with a global-view. Our performance evaluations showed that DMI can efficiently adapt the parallelism of long-running parallel iterative computations, such as a real-world finite element method and large-scale iterative graph search, to the dynamic increase and decrease of available resources through the reconfiguration.

In order to improve the resource utilization of clusters and supercomputers and thus deliver application results to users faster, it is essential for a job scheduler to expand and shrink parallel computations flexibly. In order to enable the flexible job scheduling, the parallel computations have to be reconfigurable. With this motivation, this paper proposes, implements and evaluates DMI, a global-view-based PGAS framework that enables easy programming of reconfigurable and high-performance parallel iterative computations. DMI provides programming interfaces with which a programmer can program the reconfiguration easily with a global-view. Our performance evaluations showed that DMI can efficiently adapt the parallelism of long-running parallel iterative computations, such as a real-world finite element method and large-scale iterative graph search, to the dynamic increase and decrease of available resources through the reconfiguration.

Journal

IPSJ Journal   [List of Volumes]

IPSJ Journal 52(12), 14p, 2011-12-15  [Table of Contents]

Information Processing Society of Japan (IPSJ)

Codes

  • NII Article ID (NAID) :
    110008719895
  • NII NACSIS-CAT ID (NCID) :
    AN00116647
  • Text Lang :
    ENG
  • ISSN :
    03875806
  • NDL Article ID :
    023426052
  • NDL Call No. :
    YH247-743
  • Databases :
    NDL  NII-ELS 

Share