Pandore

Author:

André Françoise1,Pazat Jean-Louis1,Thomas Henry1

Affiliation:

1. IRISA 35042 Rennes Cedex, France

Abstract

The goal of the Pandore system is to allow the execution of parallel algorithms on DMPCs (Distributed Memory Parallel Computers) without having to take into account the low-level characteristics of the target distributed computer to program the algorithm. No explicit process definition and interprocess communications are needed. Parallelization is achieved through logical data organization. The Pandore system provides the user with a mean to specify data partitioning and data distribution over a domain of virtual processors for each parallel step of his algorithm. At compile time, Pandore splits the original program into parallel processes. Each process will execute some appropriate parts of the original code, according to the given data decomposition. In order to achieve a correct utilization of the data structures distributed over the processors, the Pandore system provides an execution scheme based on a communication layer, which is an abstraction of a message-passing architecture. This intermediate level is them implemented using the effective primitives of the real architecture (in our specific case, an Intel iPSC/2).

Publisher

Association for Computing Machinery (ACM)

Reference6 articles.

1. Distributed data structures in Linda

2. Hans P. Zima Heinz-J. Bast and Michael Gerndt. SUPERB' a tool for semi-automatic MIMD/SIMD parallelization. Parallel Computing (6):1-18 1988. Hans P. Zima Heinz-J. Bast and Michael Gerndt. SUPERB' a tool for semi-automatic MIMD/SIMD parallelization. Parallel Computing (6):1-18 1988.

3. Matthew Rossing robert B. Schnabel and Robert Weaver. Dino" summary and examples. In 3' Conference on Hypercubes Concurrent Computers and Applications pages 472-481 1988. 10.1145/62297.62353 Matthew Rossing robert B. Schnabel and Robert Weaver. Dino" summary and examples. In 3' Conference on Hypercubes Concurrent Computers and Applications pages 472-481 1988. 10.1145/62297.62353

4. Process decomposition through locality of reference

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. High Performance Fortran: Status and prospects;Lecture Notes in Computer Science;1998

2. Distributed Memory Compiler Methods for Irregular Problems – Data Copy Reuse and Runtime Partitioning1 1This work is supported by NASA contract NAS1-18605 while the authors were in residence at ICASE, NASA Langley Research Center. In addition, support for author Saltz was provided by NSF from NSF grant ASC-8819374. The authors assume all responsibility for the contents of the paper.;Advances in Parallel Computing;1992

3. Pandore: A System to Manage Data Distribution;Advances in Parallel Computing;1992

4. Vienna Fortran – A Fortran Language Extension for Distributed Memory Multiprocessors* *The work described in this paper is being carried out as part of the research project “Virtual Shared Memory for Multiprocessor Systems with Distributed Memory” funded by the Austrian Research Foundation (FWF) under the grant number P7576-TEC and the ESPRIT project “An Automatic Parallelization System for Genesis” funded by the Austrian Ministry for Science and Research (BMWF). This research was also supported by the National Aeronautics and Space Administration under NASA contract NAS1-18605 while the authors were in residence at ICASE, Mail Stop 132C, NASA Langley Research Center, Hampton, VA 23666. The authors assume all responsibility for the contents of the paper.;Advances in Parallel Computing;1992

5. Code generation for data parallel programs on DMPCs;Lecture Notes in Computer Science;1991

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3