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

Binu K. Johnson

dblp:01/6699 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 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 · 22% Memory systems · 22% Distributed systems · 22%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed coordination
0.012001
DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing · IEEE Trans. Parallel Distributed Syst. 2001
Memory systems › shared memory
distributed shared memory
0.012001
DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing · IEEE Trans. Parallel Distributed Syst. 2001
Embedded and real-time systems › real-time operating systems
intertask communication
0.012001
DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing · IEEE Trans. Parallel Distributed Syst. 2001
Parallel and multicore computing
parallel programming models
0.012001
DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing · IEEE Trans. Parallel Distributed Syst. 2001
High-performance computing
cluster computing
0.012001
DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing · IEEE Trans. Parallel Distributed Syst. 2001
High-performance computing › cluster computing
network of workstations
0.012001
DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing · IEEE Trans. Parallel Distributed Syst. 2001

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

runtime support · 0.0function library · 0.0
YearPublicationVenuePosition
2001 DP: A Paradigm for Anonymous Remote Computation and Communication for Cluster Computing
abstract
This paper explores the transparent programmability of communicating parallel tasks in a Network of, Workstations (NOW). Programs which are tied up with specific machines will not be resilient to the changing conditions of a NOW. The Distributed Pipes (DP) model enables location independent intertask communication among processes' across machines. This approach enables migration of communicating parallel tasks according to runtime conditions. A transparent programming model for a parallel solution to Iterative Grid Computations using DP is also proposed. Programs written using the model are resilient to the heterogeneity of nodes and changing conditions in the NOW. They are also devoid of any network related code. The design of runtime support and function library support are presented. An engineering problem, namely, the Steady State Equilibrium Problem, is studied over the model. The performance analysis shows the speedup due to parallel execution and scaled down memory requirements. We present a case where the effect of communication overhead can be nullified to achieve a linear to super-linear speedup. The analysis discusses performance resilience of Iterative Grid Computations and characterizes synchronization delay among subtasks and the effect of network overhead and load fluctuations on performance. The performance saturation characteristics of such applications are also studied.
Binu K. Johnson, R. Karthikeyan 0002, D. Janaki Ram
IEEE Trans. Parallel Distributed Syst.1