On the Abstraction of Message-Passing Communications Using Algorithmic SkeletonsA Case Study

详细信息    查看全文

• 作者：Horacio Gonz&aacute ; lez-Vé ; lez
• 刊名：Lecture Notes in Computer Science
• 出版年：2005
• 出版时间：2005
• 年：2005
• 卷：3563
• 期：1
• 页码：p.43
• 全文大小：188 KB
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

This is an initial case on exploring the application of algorithmic skeletons to abstract low-level interprocess communication in MPI. The main purpose is intended to illustrate the competitive performance demonstrated by the skeletal approach when compared to utilization of the pure MPI, whilst providing an abstraction with reusability advantages. This initial work involves the implementation of the Wagar’s hyperquicksort algorithm in conjunction with the MPI-based eSkel skeleton library. The reported results compare three MPI-based implementations of hyperquicksort. Firstly a canonic MPI one; secondly, two implementations using the MPI-based skeletal library eSkel. Lastly, the <span class="PCode">S3L_sortspan> routine, part of its optimized numerical libraries from Sun, is employed as baseline. This overall comparison demonstrates that the use of algorithmic skeletons caused a slight performance degradation, while providing some promising guidance on the use of abstraction for low-level communication operations using the eSkel model.