Lessons from implementing the biCGStab method with SkeTo library

  • Authors:
  • Kiminori Matsuzaki;Kento Emoto

  • Affiliations:
  • Kochi University of Technology, Kami-shi, Kochi, Japan;University of Tokyo, Tokyo, Japan

  • Venue:
  • Proceedings of the fourth international workshop on High-level parallel programming and applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent computing environments achieving high performance with parallelism call for methodology for easy parallel programming, and skeletal parallel programming is such a methodology. There have been many studies on the development of parallel skeleton libraries and optimization for skeletal programs, but not so many studies have been done about applying the skeletal parallel programming to real applications. We implemented a BiCGStab method, which is widely used for solving systems of linear equations, with parallel skeletons provided in the parallel skeleton library SkeTo. First we implemented two skeletal programs, then applied optimization techniques, and finally developed efficient skeletal programs compared with the original sequential program. Through the implementation, optimization, and experiments of the skeletal programs, we obtained several lessons for realizing efficient and easy-to-use skeleton libraries. In this paper, we report the development of skeletal programs for the BiCGStab method and summarize the lessons obtained through the process.