Software for parallel computation
Janusz S. Kowalik,Lucio Grandinetti +1 more
- 01 Jan 1993
28
TL;DR: The Bird-Meertens Formalism as a Parallel Model and Object Oriented Programming Methods Suitable for Numerical Computing on Parallel Machines are studied.
read more
Abstract: 1 Introduction.- Software for Parallel Computing: Key Issues and Research Directions.- 2 Tools and Methods for Parallel Computing.- Learning From Our Successes.- Software Development for Parallel Processing.- Software Tools for Developing and Porting Parallel Programs.- Scalable Software Tools for Parallel Computations.- PVM and HeNCE: Tools for Heterogeneous Network Computing.- Distributed Shared Memory: Principles and Implementation.- FORGE 90 and High Performance Fortran (HPF).- The Bird-Meertens Formalism as a Parallel Model.- Software Issues for the PASM Parallel Processing System.- Data Migrations on the Hypercube.- Automatic Determination of Parallelism in Programs.- Are Object Oriented Programming Methods Suitable for Numerical Computing on Parallel Machines.- Parallel Relational Data Base Management System Design Aspects.- 3 Graphics.- MUDI3: a Tool for the Interactive Visual Analysis of Multidimensional Fields.- Graphical Support for Parallel Debugging.- 4 Algorithms and Applications.- Backpropagation on Distributed Memory Systems.- Mapping Algorithms on Hypercube.- Software Development for Finite Element Fluid Dynamic Applications.- Asynchronous Communication on Shared-Memory Parallel Computers.- Two Different Data-Parallel Implementations of the BLAS.- 5 Performance of Parallel Programs and Systems.- Examples of Scalable Performance.- Performance Prediction from Data Transport.- Dynamic Load Balancing in Adaptive Parallel Applications.- Performance Analysis of Dynamic Scheduling Techniques for Irregularly Structured Computation.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Fusion-Embedded Skeleton Library
Kiminori Matsuzaki,Kazuhiko Kakehi,Hideya Iwasaki,Zhenjiang Hu,Yoshiki Akashi +4 more
- 31 Aug 2004
TL;DR: A new framework for designing and implementing skeleton libraries, in which each skeleton should not only be efficiently implemented as is usually done, but also be equipped with a structured interface to combine it efficiently with other skeletons is addressed.
Parallel skeletons for manipulating general trees
Kiminori Matsuzaki,Zhenjiang Hu,Masato Takeichi +2 more
- 01 Sep 2006
TL;DR: This paper formalizes a set of skeletons (abstracted computational patterns) for rose trees (general trees of arbitrary shapes) based on the theory of Constructive Algorithmics and shows that it can implement the skeletons efficiently in parallel, by combining the parallel binary-tree skeletons for which efficient parallel implementations are already known.
Towards automatic parallelization of tree reductions in dynamic programming
Kiminori Matsuzaki,Zhenjiang Hu,Masato Takeichi +2 more
- 30 Jul 2006
TL;DR: This paper formalizes a new condition for implementing tree reductions with the tree contraction algorithms, and gives a systematic derivation of the tree contracting operations, and implemented a code generator for tree reductions, which has an optimization mechanism that can remove unnecessary computations in the derived parallel programs.
Filter-embedding semiring fusion for programming with MapReduce
TL;DR: This work proposes a novel parallel programming framework for MapReduce that consists of two important calculation theorems: the shortcut fusion theorem of semiring homomorphisms bridges the gap between specifications and efficient implementations, and the filter-embedding theorem helps to develop parallel programs in a systematic and incremental way.
Representations and Optimizations for Embedded Parallel Dataflow Languages
Alexander Alexandrov,Georgi Krastev,Volker Markl +2 more
- 29 Jan 2019
TL;DR: It is argued that the limitations listed above are a side effect of the adopted type-based embedding approach and an alternative EDSL design based on quotations is proposed, which reconciles the benefits of embedded parallel dataflow DSLs with the declarativity and optimization potential of external DSLs like SQL.
References
Topological properties of hypercubes
Y. Saad,M.H. Schultz +1 more
TL;DR: The authors examine the hypercube from the graph-theory point of view and consider those features that make its connectivity so appealing and propose a theoretical characterization of the n-cube as a graph.
1.4K
Parallel Processing with Large-Grain Data Flow Techniques
TL;DR: The Large-Grained Data Flow (LGDF) as mentioned in this paper model is a compromise between the data flow and traditional approaches, which takes a much finer grained view of system execution.
166
Program monitoring tools for parallel processing with large-grain data flow techniques
Robert G. Babb,David C. DiNucci,Lise Store +2 more
- 01 Jan 1987
TL;DR: This article describes a compromise between the data flow and traditional approaches, called the large-grain data flow, or LGDF, to distinguish it from traditional data flow architectures and languages, which take a much finer grained view of system execution.
97
Algorithms for matrix transposition on Boolean N -cube configured ensemble architecture
S. Lennart Johnsson,Ching-Tien Ho +1 more
- 01 Nov 1988
TL;DR: In this paper, the authors present algorithms for transposing a matrix embedded in a Boolean n-cube by a binary encoding, a binary-reflected Gray code encoding of rows and columns, or combinations of these two encodings.
91
•Book
On self-routing in Benesc and shuffle-exchange networks
Cauligi S. Raghavendra,Rajendra V. Boppana +1 more
- 01 Jun 1994
71
Related Papers (5)
David B. Skillicorn
- 01 Jan 1993
Zhenjiang Hu,Masato Takeichi,Wei-Ngan Chin +2 more
- 21 Jan 1998
Thomas Bemmerl
- 01 Sep 1990