BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20191206T142456Z
LOCATION:Analog 1\, 2
DTSTART;TZID=Europe/Stockholm:20180627T100000
DTEND;TZID=Europe/Stockholm:20180627T110000
UID:isc_hpc_ISC High Performance 2018_sess148_apost110@linklings.com
SUMMARY:(A04) Poster from Japan: ppOpen-SOL: Robust ILU Preconditioner for
  Exascale
DESCRIPTION:HPC in Asia\n\n(A04) Poster from Japan: ppOpen-SOL: Robust ILU
  Preconditioner for Exascale\n\nKawai, Ida, Wellein\n\nAn objective of thi
 s study is to solve generalized eigenvalue problems derived from quantum s
 imulations with exascale systems. To solve eigenvalue problems, we use Sak
 urai-Sugiura or FEAST method because of versatile. However, we have to sol
 ve large-scale systems of linear equations which have ill-conditioned and 
 sparse coefficient matrices. Then, we considered the applicability of a mu
 lti-color parallelized ILU preconditioned Krylov subspace method. To impro
 ve robustness we applied regularizations to the ILU preconditioner, and to
  support massive parallelism, we proposed a hierarchical parallelization f
 or multi-coloring algorithms.\n\nIf conventional ILU factorization methods
  are applied to target applications, there are many problems, such as accu
 mulation of rounding error, a breakdown of factorization, etc. We proposed
  the two types of regularization methods for overcoming such problems, (1)
  blocking and (2) diagonal shifting of coefficient matrices. These regular
 ization methods provide conventional ILU preconditioned Krylov subspace me
 thod with excellent robustness.\n\nFor massive parallelism, we proposed a 
 new hierarchical multi-coloring method in the ILU preconditioner. The mult
 icolor is often used for parallelization of ILU factorizations and forward
 -backward substitutions. Coloring algorithms have much impact on convergen
 ce rate and performance of the ILU preconditioned Krylov subspace method. 
 The multi-coloring with hierarchical parallelization has a small influence
  on convergence rate.\n\nWe evaluated the proposed method by the graphene 
 applications with 500M DOF on the Fujitsu PRIMEHPC FX10 supercomputer. By 
 both the approaches, the number of iterations on each number of processes 
 does not differ much. In addition, excellent parallel performance up to 4,
 800 nodes (76,800cores) has been obtained.\n\nPasses: Conference Pass
URL:https://2018.isc-program.com/presentation/?id=apost110&sess=sess148
END:VEVENT
END:VCALENDAR