A diskless checkpointing algorithm for super-scale architectures applied to the fast Fourier transform

被引:12
|
作者
Engelmann, C [1 ]
Geist, A [1 ]
机构
[1] Oak Ridge Natl Lab, Comp Sci & Math Div, Oak Ridge, TN 37831 USA
关键词
D O I
10.1109/CLADE.2003.1209999
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper discusses the issue of fault-tolerance in distributed computer systems with tens or hundreds of thousands of diskless processor units. Such systems, like the IBM BlueGene/L, are predicted to be deployed in the next five to ten years. Since a 100,000-processor system is going to be less reliable, scientific applications need to be able to recover from occurring failures more efficiently. In this paper we adapt the present technique of diskless checkpointing to such huge distributed systems in order to equip existing scientific algorithms with super-scalable fault-tolerance. First, we discuss the method of diskless checkpointing, then we adapt this technique to super-scale architectures and finally we present results from an implementation of the Fast Fourier Transform that uses the adapted technique to achieve super-scale fault-tolerance.
引用
收藏
页码:47 / 52
页数:6
相关论文
共 50 条
  • [11] DISCRETE FOURIER-TRANSFORM AND FAST FOURIER ALGORITHM
    KRISHNAN, V
    JOURNAL OF THE INDIAN INSTITUTE OF SCIENCE, 1974, 56 (05): : 227 - 249
  • [12] Fast Fourier transform accelerated fast multipole algorithm
    Elliott, WD
    Board, JA
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1996, 17 (02): : 398 - 415
  • [13] Fast algorithm for computing nonuniform Fourier transform
    Xiao, YC
    Wei, P
    Tai, HM
    CHINESE JOURNAL OF ELECTRONICS, 2006, 15 (01): : 117 - 119
  • [14] A fast algorithm for multiresolution discrete Fourier transform
    Andreatto, Bartosz
    Cariow, Aleksandr
    PRZEGLAD ELEKTROTECHNICZNY, 2012, 88 (11A):
  • [15] An improved fast polar Fourier transform algorithm
    Xu, MK
    Ping, XJ
    THIRD INTERNATIONAL SYMPOSIUM ON MULTISPECTRAL IMAGE PROCESSING AND PATTERN RECOGNITION, PTS 1 AND 2, 2003, 5286 : 445 - 448
  • [16] Forms of a minimum fast Fourier transform algorithm
    Sudakov, Yu.A.
    Soviet journal of communications technology & electronics, 1992, 37 (12): : 20 - 26
  • [17] THE REDISCOVERY OF THE FAST FOURIER-TRANSFORM ALGORITHM
    COOLEY, JW
    MIKROCHIMICA ACTA, 1987, 3 (1-6) : 33 - 45
  • [18] MULTIDIMENSIONAL FAST-FOURIER-TRANSFORM ALGORITHM
    ARAMBEPOLA, B
    RAYNER, PJW
    ELECTRONICS LETTERS, 1979, 15 (13) : 382 - 383
  • [19] Novel fast algorithm for fractional Fourier transform
    Ping, X.J.
    Tao, R.
    Zhou, S.Y.
    Wang, Y.
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2001, 29 (03): : 406 - 408
  • [20] Fast algorithm for modular exponentiation based on fast fourier transform
    Fuguo D.
    Yuxin T.
    Lin D.
    Journal of Convergence Information Technology, 2011, 6 (06) : 500 - 506