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 条
  • [1] A Diskless Checkpointing Algorithm for Cluster Architectures Applied to Geospatial Raster Data Processing
    Song, Xiaodong
    Dou, Wanfeng
    Tang, Guoan
    Yang, Kun
    Qian, Kejian
    JOURNAL OF ALGORITHMS & COMPUTATIONAL TECHNOLOGY, 2014, 8 (04) : 369 - 387
  • [2] Super fast Fourier transform
    Agaian, Sos S.
    Caglayan, Okan
    IMAGE PROCESSING: ALGORITHMS AND SYSTEMS, NEURAL NETWORKS, AND MACHINE LEARNING, 2006, 6064
  • [3] HDL Implementation of DFT architectures using Winograd Fast Fourier Transform Algorithm
    Vinchurkar, Prathamesh P.
    Rathkanthiwar, S. V.
    Kakde, S. M.
    2015 FIFTH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORK TECHNOLOGIES (CSNT2015), 2015, : 397 - 401
  • [4] High Performance DFT Architectures Using Winograd Fast Fourier Transform Algorithm
    Rathkanthiwar, Shubhangi
    Kakde, Sandeep
    Thakare, Rajesh
    Kamdi, Rahul
    Kamble, Shailesh
    INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, VOL 1, INDIA 2016, 2016, 433 : 559 - 567
  • [5] A class of parallel architectures for fast Fourier transform
    Yeh, CH
    Parhami, B
    PROCEEDINGS OF THE 39TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I-III, 1996, : 856 - 859
  • [6] On a Fast Algorithm for Computing the Fourier Transform
    A. A. Aleksashkina
    A. N. Kostromin
    Yu. V. Nesterenko
    Moscow University Mathematics Bulletin, 2021, 76 : 123 - 128
  • [7] An improved fast Fourier transform algorithm
    Mieee, GB
    Chen, YQ
    ICICS - PROCEEDINGS OF 1997 INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATIONS AND SIGNAL PROCESSING, VOLS 1-3: THEME: TRENDS IN INFORMATION SYSTEMS ENGINEERING AND WIRELESS MULTIMEDIA COMMUNICATIONS, 1997, : 1308 - 1310
  • [8] FAST FOURIER TRANSFORM ALGORITHM.
    Cabion, P.J.
    Transactions of the South African Institute of Electrical Engineers, 1980, 71 (pt 5): : 112 - 116
  • [9] FAST-FOURIER-TRANSFORM ALGORITHM
    ROZENBLAT, MS
    SHVETSKII, BI
    AUTOMATION AND REMOTE CONTROL, 1975, 36 (04) : 648 - 656
  • [10] On a Fast Algorithm for Computing the Fourier Transform
    Aleksashkina, A. A.
    Kostromin, A. N.
    Nesterenko, Yu, V
    MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2021, 76 (03) : 123 - 128