B. Chamberlain, Sung-Eun Choi, E. Lewis, Calvin Lin, L. Snyder, Derrick Weathersby
{"title":"ZPL's WYSIWYG performance model","authors":"B. Chamberlain, Sung-Eun Choi, E. Lewis, Calvin Lin, L. Snyder, Derrick Weathersby","doi":"10.1109/HIPS.1998.665143","DOIUrl":null,"url":null,"abstract":"ZPL is a parallel array language designed for high performance scientific and engineering computations. Unlike other parallel languages, ZPL is founded on a machine model (the CTA) that accurately abstracts contemporary MIMD parallel computers. This makes it possible to correlate ZPL programs with machine behavior. As a result, programmers can reason about how code will perform on a typical parallel machine and thereby make informed decisions between alternative programming solutions. The paper describes ZPL's performance model and its syntactic cues for conveying operation cost. The what you see is what you get (WYSIWYG) nature of ZPL operations is demonstrated on the IBM SP-2, Intel Paragon, SGI Power Challenge, and Cray T3E. Additionally, the model is used to evaluate two algorithms for matrix multiplication. Experiments show that the performance model correctly predicts the faster solution on all four platforms for a range of problem sizes.","PeriodicalId":179985,"journal":{"name":"Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments","volume":"55 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Third International Workshop on High-Level Parallel Programming Models and Supportive Environments","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIPS.1998.665143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 42
摘要
ZPL是一种为高性能科学和工程计算而设计的并行数组语言。与其他并行语言不同，ZPL建立在机器模型(CTA)上，该模型精确地抽象了当代MIMD并行计算机。这使得将ZPL程序与机器行为联系起来成为可能。因此，程序员可以推断代码将如何在典型的并行机器上执行，从而在可选的编程解决方案之间做出明智的决策。本文描述了ZPL的性能模型及其用于输送运行成本的语法线索。所见即所得(所见即所得)的ZPL操作性质在IBM SP-2、Intel Paragon、SGI Power Challenge和Cray T3E上得到了演示。此外，该模型还用于评估两种矩阵乘法算法。实验表明，性能模型在所有四个平台上正确地预测了一系列问题大小的更快解决方案。
ZPL is a parallel array language designed for high performance scientific and engineering computations. Unlike other parallel languages, ZPL is founded on a machine model (the CTA) that accurately abstracts contemporary MIMD parallel computers. This makes it possible to correlate ZPL programs with machine behavior. As a result, programmers can reason about how code will perform on a typical parallel machine and thereby make informed decisions between alternative programming solutions. The paper describes ZPL's performance model and its syntactic cues for conveying operation cost. The what you see is what you get (WYSIWYG) nature of ZPL operations is demonstrated on the IBM SP-2, Intel Paragon, SGI Power Challenge, and Cray T3E. Additionally, the model is used to evaluate two algorithms for matrix multiplication. Experiments show that the performance model correctly predicts the faster solution on all four platforms for a range of problem sizes.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
