Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Edwin M. R. M. Paalvast

dblp:84/6227 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 87% Distributed systems · 13%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel programming models
data-parallel language
0.011996
An Implementation Framework for HPF Distributed Arrays on Message-Passing Parallel Computer Systems · IEEE Trans. Parallel Distributed Syst. 1996
Parallel and multicore computing
parallel programming models
0.011996
An Implementation Framework for HPF Distributed Arrays on Message-Passing Parallel Computer Systems · IEEE Trans. Parallel Distributed Syst. 1996
Distributed systems › operating system support › interprocess communication
message-passing systems
0.011996
An Implementation Framework for HPF Distributed Arrays on Message-Passing Parallel Computer Systems · IEEE Trans. Parallel Distributed Syst. 1996

Methods — techniques the papers use, named apart from their topics

ownership test transformation · 0.0local index enumeration · 0.0block-cyclic distribution · 0.0
YearPublicationVenuePosition
1996 An Implementation Framework for HPF Distributed Arrays on Message-Passing Parallel Computer Systems
abstract
Data parallel languages, like High Performance Fortran (HPF), support the notion of distributed arrays. However, the implementation of such distributed array structures and their access on message passing computers is not straightforward. This holds especially for distributed arrays that are aligned to each other and given a block-cyclic distribution. In this paper, an implementation framework is presented for HPF distributed arrays on message passing computers. Methods are presented for efficient (in space and time) local index enumeration, local storage, and communication. Techniques for local set enumeration provide the basis for constructing local iteration sets and communication sets. It is shown that both local set enumeration and local storage schemes can be derived from the same equation. Local set enumeration and local storage schemes are shown to be orthogonal, i.e., they can be freely combined. Moreover, for linear access sequences generated by our enumeration methods, the local address calculations can be moved out of the enumeration loop, yielding efficient local memory address generation. The local set enumeration methods are implemented by using a relatively simple general transformation rule for absorbing ownership tests. This transformation rule can be repeatedly applied to absorb multiple ownership tests. Performance figures are presented for local iteration overhead, a simple communication pattern, and storage efficiency.
Kees van Reeuwijk, Will Denissen, Henk J. Sips, Edwin M. R. M. Paalvast
IEEE Trans. Parallel Distributed Syst.4
1992 A Taxonomy of User-Annotated Programs for Distributed Memory Computers
Henry Thomas, Henk J. Sips, Edwin M. R. M. Paalvast
ICPP (2)3
1991 The Booster Approach to Annotating Parallel Algorithms
Leo C. Breebaart, Edwin M. R. M. Paalvast, Henk J. Sips
ICPP (2)2
1991 Automatic Parallel Program Generation and Optimization from Data Decompositions
Edwin M. R. M. Paalvast, Henk J. Sips, Arjan J. C. van Gemund
ICPP (2)1
1990 A method for parallel program generation with an application to the Booster language
abstract
This paper describes a translation method for the automatic parallelization of programs based on a separately specified representation of the data. The method unifies the concept of data-representation on the algorithm-level as well as machine-level, based on the so-called view concept. It is shown that given a decomposition of the data, application of the translation method to the view-based Booster programming language results in efficient SPMD-code for distributed- as well as shared-memory architectures. It will be argued that the method is not restricted to Booster, but can also be applied to other languages.
Edwin M. R. M. Paalvast, Arjan J. C. van Gemund, Henk J. Sips
ICS1