Non-strict Evaluation of the FFT Algorithm in Distributed Memory Systems

  • Alfredo Cristóbal-Salas
  • Andrei Tchernykh
  • Jean-Luc Gaudiot
Conference paper

DOI: 10.1007/978-3-540-39924-7_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2840)
Cite this paper as:
Cristóbal-Salas A., Tchernykh A., Gaudiot JL. (2003) Non-strict Evaluation of the FFT Algorithm in Distributed Memory Systems. In: Dongarra J., Laforenza D., Orlando S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg

Abstract

This paper focuses on the partial evaluation of local and remote memory accesses of distributed applications, not only to remove much of the excess overhead of message passing implementations, but also to reduce the number of messages, when some information about the input data set is known. The use of split- phase memory operations, the exploitation of spatial data locality, and non-strict information processing are described. Through a detailed performance analysis, we establish conditions under which the technique is beneficial. We show that by incorporating non-strict information processing to FFT MPI, a significant reduction of the number of messages can be archived, and the overall system performance can be improved.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alfredo Cristóbal-Salas
    • 1
  • Andrei Tchernykh
    • 2
  • Jean-Luc Gaudiot
    • 3
  1. 1.School of Chemistry Sciences and EngineeringUniversity of Baja CaliforniaTijuanaMexico
  2. 2.Computer Science DepartmentCICESE Research CenterEnsenadaMexico
  3. 3.Electrical Engineering and Computer ScienceUniversity of CaliforniaIrvineUSA

Personalised recommendations