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

Neeraj Krishnan

dblp:42/6088 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 2Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Distributed systems · 36% Performance modeling and evaluation · 23% High-performance computing · 18%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
graph visualization
0.112006
ASK-GraphView: A Large Scale Graph Visualization System · IEEE Trans. Vis. Comput. Graph. 2006
Cloud and datacenter computing › datacenter services › online service systems › internet services
cluster-based internet services
0.012003
Quantifying and Improving the Availability of High-Performance Cluster-Based Internet Services · SC 2003
Distributed systems
fault tolerance
0.012003
Quantifying and Improving the Availability of High-Performance Cluster-Based Internet Services · SC 2003
Distributed systems › fault tolerance
high availability
0.012003
Quantifying and Improving the Availability of High-Performance Cluster-Based Internet Services · SC 2003
Performance modeling and evaluation
performability
0.012003
Evaluating the Impact of Communication Architecture on the Performability of Cluster-Based Services · HPCA 2003
High-performance computing › cluster computing
server cluster
0.012003
Evaluating the Impact of Communication Architecture on the Performability of Cluster-Based Services · HPCA 2003
Visualization and visual analytics › graph visualization
node-link diagram
0.012006
ASK-GraphView: A Large Scale Graph Visualization System · IEEE Trans. Vis. Comput. Graph. 2006
Performance modeling and evaluation
analytical modeling
0.012003
Evaluating the Impact of Communication Architecture on the Performability of Cluster-Based Services · HPCA 2003
Hardware reliability and fault tolerance
fault injection
0.012003
Evaluating the Impact of Communication Architecture on the Performability of Cluster-Based Services · HPCA 2003

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

out-of-core hierarchy construction · 0.1clustering algorithm · 0.1fault model enforcement · 0.0fault injection · 0.0analytic modeling · 0.0
YearPublicationVenuePosition
2006 ASK-GraphView: A Large Scale Graph Visualization System
abstract
We describe ASK-GraphView, a node-link-based graph visualization system that allows clustering and interactive navigation of large graphs, ranging in size up to 16 million edges. The system uses a scalable architecture and a series of increasingly sophisticated clustering algorithms to construct a hierarchy on an arbitrary, weighted undirected input graph. By lowering the interactivity requirements we can scale to substantially bigger graphs. The user is allowed to navigate this hierarchy in a top down manner by interactively expanding individual clusters. ASK-GraphView also provides facilities for filtering and coloring, annotation and cluster labeling.
James Abello, Frank van Ham, Neeraj Krishnan
IEEE Trans. Vis. Comput. Graph.3
2003 Evaluating the Impact of Communication Architecture on the Performability of Cluster-Based Services
abstract
We consider the impact of different communication architectures on the performability (performance plus availability) of cluster-based servers. In particular, we use a combination of fault-injection experiments and analytic modeling to evaluate the performability of two popular communication protocols, TCP and VIA, as the intra-cluster communication substrate of a sophisticated Web server. Our analysis leads to several interesting conclusions, the most surprising of which is, under the same fault load, VIA-based servers deliver greater availability than TCP-based servers. If we assume higher fault rates for VIA-based servers because the underlying technology is more immature and programming model more complex, we find that packet errors or application faults would have to occur at approximately 4 times the rate in TCP-based servers before their performabilities equalize. We use our results from the study to suggest that high-performance and robust communication layers for highly available cluster-based servers should preserve message boundaries, as opposed to using byte streams, use single-copy transfers, pre-allocate channel resources, and report errors in manner consistent with the network fabric's fault model.
Kiran Nagaraja, Neeraj Krishnan, Ricardo Bianchini, Richard P. Martin, Thu D. Nguyen
HPCA2
2003 Quantifying and Improving the Availability of High-Performance Cluster-Based Internet Services
abstract
Cluster-based servers can substantially increase performance when nodes cooperate to globally manage resources. However, in this paper we show that cooperation results in a substantial availability loss, in the absence of high-availability mechanisms. Specifically, we show that a sophisticated cluster-based Web server, which gains a factor of 3 in performance through cooperation, increases service unavailability by a factor of 10 over a non-cooperative version. We then show how to augment this Web server with software components embodying a small set of high-availability techniques to regain the lost availability. Among other interesting observations, we show that the application of multiple high-availability techniques, each implemented independently in its own subsystem, can lead to inconsistent recovery actions. We also show that a novel technique called Fault Model Enforcement can be used to resolve such inconsistencies. Augmenting the server with these techniques led to a final expected availability of close to 99.99%.
Kiran Nagaraja, Neeraj Krishnan, Ricardo Bianchini, Richard P. Martin, Thu D. Nguyen
SC2