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

Barry Koren

dblp:81/825 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2004
0009-0008-1169-1157ORCID · corroborated

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

Systems, architecture and hardware · 3Software engineering, systems software and programming languages · 1

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% High-performance computing · 13%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%

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

TopicWeightPapersLastEvidence papers
Software maintenance and evolution › software reengineering
software modernization
0.012004
Modernizing Existing Software: A Case Study · SC 2004
Parallel and multicore computing › parallel programming models › concurrent programming languages
coordination language
0.012004
Modernizing Existing Software: A Case Study · SC 2004
Parallel and multicore computing
parallel programming models
0.012004
Modernizing Existing Software: A Case Study · SC 2004
High-performance computing › scientific computing
scientific computing application
0.012004
Modernizing Existing Software: A Case Study · SC 2004

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

cut-and-paste restructuring · 0.1MANIFOLD coordination language · 0.1
YearPublicationVenuePosition
2004 Modernizing Existing Software: A Case Study
abstract
In this paper, we discuss one of our experiments using the coordination language MANIFOLD to restructure an existing sequential numerical application into a concurrent application. The application was written in ANSI C and deals with a sparse-grid method for a transport problem. Our approach is simple and is in fact a cut-and-paste method. First, we try to identify and isolate components in the legacy source code (the cut). Second, we glue them together by writing coordinator modules (glue modules) with the help of a coordination language (the paste). We also give some performance results.
C. T. H. Everaars, Farhad Arbab, Barry Koren
SC3
2001 Using Coordination to Restructure Sequential Source Code into a Concurrent Program
abstract
A workable approach for modernization of existing software into parallel/distributed applications is through coarse-grain restructuring. If, for instance, entire subroutines of legacy code can be plugged into a new structure, the investment required for the rediscovery of the details of what they do can be spared. The resulting renovated software can then take advantage of the improved performance offered by modern parallel/distributed computing environments, without rethinking or rewriting the bulk of their existing code. The authors discuss one of their experiments using the coordination language MANIFOLD to restructure an existing sequential numerical application written in Fortran 77, into a concurrent application.
C. T. H. Everaars, Farhad Arbab, Barry Koren
ICSM3
2000 Dynamic Process Composition and Communication Patterns in Irregularly Structured Applications
abstract
In this paper we describe one experiment in which a new co-ordination language, called Manifold, is used to restructure an existing sequential Fortran 77 code from computational fluid dynamics (CFD), into a parallel application. Manifold is a co-ordination language developed at CWI (Centrum voor Wiskunde en Informatica) in the Netherlands. It is very well suited for applications involving dynamic process creation and dynamically changing (ir)regular communication patterns among sets of independent concurrent co-operating processes. With a simple but generic master/worker protocol, written in the Manifold language, we are able to reuse the existing code without rethinking or rewriting it. The performance evaluation of a standard 3D CFD problem shows that Manifold performs very well. Copyright © 2000 John Wiley & Sons, Ltd.
C. T. H. Everaars, Farhad Arbab, Barry Koren
Concurr. Pract. Exp.3
1998 Using Coordination to Parallelize Sparse-Grid Methods for 3-D CFD Problems
Kees Everaars, Barry Koren
Parallel Comput.2