Article

Free access

Pandore: a system to manage data distribution

Authors:

Françoise André,

Jean-Louis Pazat,

Henry ThomasAuthors Info & Claims

ICS '90: Proceedings of the 4th international conference on Supercomputing

Pages 380 - 388

https://doi.org/10.1145/77726.255179

Published: 01 June 1990 Publication History

PDF eReader

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).

References

[1]

Geoffrey C. Fox and Woitek Furmansky. Communication algorithms for regular convolutions and matrix problems on the hypercube. In Hypercube Mnl. tiprocessors, pages 223-238, 1987.

Google Scholar

[2]

Nicholas Carriero, David Gelernter, and Jerry Leichter. Distributed data structures in linda. In Thirteenth Annual A CM Symposium oft Principles of Programming Langages, 1986.

Digital Library

Google Scholar

[3]

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

Google Scholar

[4]

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.

Digital Library

Google Scholar

[5]

Anne Rogers and Keshav Pingali. Process decomposition through locality of reference. In Conference oft Programming Language Design and Implementation, pages 69-80, ACM, June 21-23 1989.

Digital Library

Google Scholar

[6]

David Callahan and Ken Kennedy. Compiling programs for distributed-memory multiprocessors. The Journal of Supercomputing, (2):151-169, 1988.

Google Scholar

[7]

Charles Koebel and Piyush Mehrotra. Supporting Shared Data Structures on Distributed Memory Architectures. Technical Report csd-tr 915, Department of Computer Science, Purdue University, 1990.

Google Scholar

Cited By

View all

Kalyur SNagaraja G(2017)Concerto: A Program Parallelization, Orchestration and Distribution Infrastructure2017 2nd International Conference on Computational Systems and Information Technology for Sustainable Solution (CSITSS)10.1109/CSITSS.2017.8447691(1-6)Online publication date: Dec-2017
https://doi.org/10.1109/CSITSS.2017.8447691
Diaconescu RZima H(2007)An Approach To Data Distributions in ChapelInternational Journal of High Performance Computing Applications10.1177/109434200707845121:3(313-335)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1177/1094342007078451
Kennedy KKoelbel CZima HRyder BHailpern B(2007)The rise and fall of High Performance FortranProceedings of the third ACM SIGPLAN conference on History of programming languages10.1145/1238844.1238851(7-1-7-22)Online publication date: 9-Jun-2007
https://dl.acm.org/doi/10.1145/1238844.1238851
Show More Cited By

Index Terms

Pandore: a system to manage data distribution

Recommendations

Pandore: a system to manage data distribution
Special Issue: Proceedings of the 4th international conference on Supercomputing

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 ...
OpenMP for Networks of SMPs

In this paper, we present the first system that implements OpenMP on a network of shared-memory multiprocessors. This system enables the programmer to rely on a single, standard, shared-memory API for parallelization within a multiprocessor and between ...
SPMD OpenMP versus MPI on a IBM SMP for 3 Kernels of the NAS Benchmarks
ISHPC '02: Proceedings of the 4th International Symposium on High Performance Computing

Shared Memory Multiprocessors are becoming more popular since they are used to deploy large parallel computers. The current trend is to enlarge the number of processors inside such multiprocessor nodes. However a lot of existing applications are using ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICS '90: Proceedings of the 4th international conference on Supercomputing

June 1990

492 pages

ISBN:0897913698

DOI:10.1145/77726

Chairmen:
Ahmed Sameh
Univ. of Illinois
,
Henk van der Vorst
Delft Univ. of Technology and CWI, The Netherlands

ACM SIGARCH Computer Architecture News Volume 18, Issue 3b
Special Issue: Proceedings of the 4th international conference on Supercomputing
Sept. 1990
489 pages
ISSN:0163-5964
DOI:10.1145/255129
Chairmen:
Ahmed Sameh
Univ. of Illinois at Urbana-Champaign, Urbana
,
Henk van der Vorst
Delft Univ. of Technology and CWI, The Netherlands
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

IC'90

Sponsor:

SIGARCH

IC'90: ACM SIGARCH International Conference on Supercomputing

June 11 - 15, 1990

Amsterdam, The Netherlands

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

49
Total Citations
View Citations
291
Total Downloads

Downloads (Last 12 months)21
Downloads (Last 6 weeks)4

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kalyur SNagaraja G(2017)Concerto: A Program Parallelization, Orchestration and Distribution Infrastructure2017 2nd International Conference on Computational Systems and Information Technology for Sustainable Solution (CSITSS)10.1109/CSITSS.2017.8447691(1-6)Online publication date: Dec-2017
https://doi.org/10.1109/CSITSS.2017.8447691
Diaconescu RZima H(2007)An Approach To Data Distributions in ChapelInternational Journal of High Performance Computing Applications10.1177/109434200707845121:3(313-335)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1177/1094342007078451
Kennedy KKoelbel CZima HRyder BHailpern B(2007)The rise and fall of High Performance FortranProceedings of the third ACM SIGPLAN conference on History of programming languages10.1145/1238844.1238851(7-1-7-22)Online publication date: 9-Jun-2007
https://dl.acm.org/doi/10.1145/1238844.1238851
Guidec FJézéquel J(2005)Polymorphic matrices in paladinObject-Based Parallel and Distributed Computation10.1007/3-540-61487-7_20(18-37)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-61487-7_20
Naohito SSatoshi MAkinori Y(2005)Hierarchical collections: An efficient scheme to build an object-oriented distributed class library for massively parallel computationObject Technologies for Advanced Software10.1007/3-540-60954-7_46(96-117)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-60954-7_46
Chapman BMehrotra PZima H(2005)High-level languages for parallel scientific computingSOFSEM '95: Theory and Practice of Informatics10.1007/3-540-60609-2_14(292-314)Online publication date: 6-Jun-2005
https://doi.org/10.1007/3-540-60609-2_14
Bareau CCaillaud BJard CThoraval R(2005)Correctness of automated distribution of sequential programsPARLE '93 Parallel Architectures and Languages Europe10.1007/3-540-56891-3_41(517-528)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-56891-3_41
Jézéquel JBergheul FAndré F(2005)Programming massively parallel architectures with sequential object oriented languagesPARLE '92 Parallel Architectures and Languages Europe10.1007/3-540-55599-4_97(329-344)Online publication date: 14-Jul-2005
https://doi.org/10.1007/3-540-55599-4_97
Merlin J(2005)ADAPTing Fortran 90 array programs for distributed memory architecturesParallel Computation10.1007/3-540-55437-8_80(184-200)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-55437-8_80
Girault A(2002)Elimination of redundant messages with a two-pass static analysis algorithmParallel Computing10.1016/S0167-8191(01)00150-828:3(433-453)Online publication date: 1-Mar-2002
https://dl.acm.org/doi/10.1016/S0167-8191%2801%2900150-8
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Pandore: a system to manage data distribution

OpenMP for Networks of SMPs

SPMD OpenMP versus MPI on a IBM SMP for 3 Kernels of the NAS Benchmarks