Data Parallel Fortran

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1992-10-19 DOI:10.1109/FMPC.1992.234909

P. Elustondo, L. A. Vazquez, O.J. Nestares, J. S. Avalos, G. A. Alvarez, C.-T. Ho, J. Sanz

{"title":"Data Parallel Fortran","authors":"P. Elustondo, L. A. Vazquez, O.J. Nestares, J. S. Avalos, G. A. Alvarez, C.-T. Ho, J. Sanz","doi":"10.1109/FMPC.1992.234909","DOIUrl":null,"url":null,"abstract":"The authors present Data Parallel Fortran (DPF), a set of extensions to Fortran aimed at programming scientific applications on a variety of parallel machines. DPF portrays a global name space to programmers and allows programs to be written in a clear, data-parallel style. DPF's model is based on the idea of having a single control thread that spans parallel virtual threads with arbitrary nesting, resuming at their completion into a single global state. It also provides explicit control of which subset of the global name space is strictly accessed by each virtual processor at different points in a program. This powerful mechanism makes it possible to write programs in which communication points are handled explicitly, but without making use of message passing code. Also, DPF offers some primitives that involve communication often encountered in parallel numerical and scientific applications. DPF semantics does not depend on any particular feature of the architecture, thus providing a reasonably high-level programming methodology.<<ETX>>","PeriodicalId":117789,"journal":{"name":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1992.234909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

Abstract

The authors present Data Parallel Fortran (DPF), a set of extensions to Fortran aimed at programming scientific applications on a variety of parallel machines. DPF portrays a global name space to programmers and allows programs to be written in a clear, data-parallel style. DPF's model is based on the idea of having a single control thread that spans parallel virtual threads with arbitrary nesting, resuming at their completion into a single global state. It also provides explicit control of which subset of the global name space is strictly accessed by each virtual processor at different points in a program. This powerful mechanism makes it possible to write programs in which communication points are handled explicitly, but without making use of message passing code. Also, DPF offers some primitives that involve communication often encountered in parallel numerical and scientific applications. DPF semantics does not depend on any particular feature of the architecture, thus providing a reasonably high-level programming methodology.<>

查看原文本刊更多论文

数据并行Fortran

作者提出了数据并行Fortran (DPF)，这是Fortran的一组扩展，旨在在各种并行机器上编程科学应用程序。DPF向程序员描绘了一个全局名称空间，并允许以清晰的数据并行风格编写程序。DPF的模型基于这样的思想，即拥有一个控制线程，该线程跨越具有任意嵌套的并行虚拟线程，在它们完成时恢复到单个全局状态。它还提供了对全局名称空间的哪个子集由每个虚拟处理器在程序的不同点严格访问的显式控制。这种强大的机制使得编写显式处理通信点的程序成为可能，但不使用消息传递代码。此外，DPF还提供了一些涉及在并行数值和科学应用程序中经常遇到的通信的原语。DPF语义不依赖于体系结构的任何特定特性，因此提供了一种相当高级的编程方法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量