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

Meera Balakrishnan

dblp:90/5529 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 5 · 4 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
3 papers
Hardware reliability and fault tolerance · 83% Electronic design automation · 17%
Computer networks
1 paper
Internet architecture and protocols · 77% Routing and switching · 23%

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

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance
reliability modeling
0.031994
Reliability Models for Fault-Tolerant Private Network Applications · IEEE Trans. Computers 1994
An Analysis of a Reliability Model for Repairable Fault-Tolerant Systems · IEEE Trans. Computers 1993
On Reliability Modeling of Closed Fault-Tolerant Computer Systems · IEEE Trans. Computers 1990
Hardware reliability and fault tolerance › reliability modeling
markov reliability model
0.021993
An Analysis of a Reliability Model for Repairable Fault-Tolerant Systems · IEEE Trans. Computers 1993
On Reliability Modeling of Closed Fault-Tolerant Computer Systems · IEEE Trans. Computers 1990
Electronic design automation
state-space model
0.011994
Reliability Models for Fault-Tolerant Private Network Applications · IEEE Trans. Computers 1994
Hardware reliability and fault tolerance › system reliability
repairable fault-tolerant system
0.011993
An Analysis of a Reliability Model for Repairable Fault-Tolerant Systems · IEEE Trans. Computers 1993
Routing and switching › adaptive routing
dynamic rerouting
0.011994
Reliability Models for Fault-Tolerant Private Network Applications · IEEE Trans. Computers 1994

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

state-space lumping · 0.0simulation · 0.0markov chain · 0.0lagrange-sylvester interpolation · 0.0continuous-time markov chain · 0.0matrix theory · 0.0
YearPublicationVenuePosition
1994 Reliability Models for Fault-Tolerant Private Network Applications
abstract
A private or corporate network connects the offices of a single large organization, such as an airline or a bank, using leased private lines. To improve the reliability of network applications, fault-tolerance can be incorporated directly into the private network. In this paper, we use a state-space model to capture the effect of dynamic rerouting and repair and investigate the effect on reliability of different repair-and-rerouting strategies at the application or call level. To reduce the potentially large state space that results, we construct an approximate Markov model with a smaller state space by lumping together similar states. The lumped model includes coverage parameters that can be estimated without considering the original model in its entirety. This allows the state-space model to be solved accurately and efficiently. We compare results of the approximation technique with results obtained by a complete simulation of the original network. We expect similar approximation techniques to be effective on models with large state spaces which obtain processes with many time-scales.>
Meera Balakrishnan, Andrew L. Reibman
IEEE Trans. Computers1
1993 An Analysis of a Reliability Model for Repairable Fault-Tolerant Systems
abstract
The ARIES reliability model, which models a class of repairable and nonrepairable fault-tolerant systems by a continuous-time Markov chain and uses the Lagrange-Sylvester interpolation formula to directly compute the exponential of the state transition rate matrix (STRM) that appears in the solution of the Markov chain, is discussed. The properties of the STRM for ARIES repairable systems are analyzed. Well-established results in matrix theory are used to find an efficient solution for reliability computation when the eigenvalues of the STRM are distinct. A class of systems that ARIES models for which the solution technique is inapplicable is identified. Several transformations which are known to be numerically stable are used in the solution method. The solution method also offers a facility for incrementally computing reliability when the number of spares in the fault-tolerant system is increased by one.>
Meera Balakrishnan, Cauligi S. Raghavendra
IEEE Trans. Computers1
1990 On Reliability Modeling of Closed Fault-Tolerant Computer Systems
abstract
It is observed that a large number of closed fault-tolerant systems modeled by a continuous-time Markov model referred to as the ARIES model have repeated eigenvalues. It is proven that the rate matrix representing the system is diagonalizable for every closed fault tolerant system modeled by ARIES. Consequently, the Lagrange-Sylvester interpolation formula is applicable to all closed fault-tolerant systems which ARIES models. Since the proof guarantees that the rate matrix is diagonalizable, general methods for solving arbitrary Markov chains can be tailored to solve the ARIES model for the closed systems directly.>
Meera Balakrishnan, Cauligi S. Raghavendra
IEEE Trans. Computers1
1988 On Array Storage for Conflict-Free Memory Access for Parallel Processors
Meera Balakrishnan, Rajiv Jain, Cauligi S. Raghavendra
ICPP (1)1
1986 Trace-Driven Simulations of Parallel and Distributed Algorithms in Multiprocessors
Michel Dubois 0001, Faye A. Briggs, Indira Patil, Meera Balakrishnan
ICPP4