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

Prasad R. Chintamaneni

dblp:38/2886 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

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

Systems, architecture and hardware · 1Software 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
Distributed systems · 88% Performance modeling and evaluation · 12%

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

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance › checkpointing
checkpointing strategies
0.011990
Modeling of Hierarchical Distributed Systems with Fault-Tolerance · IEEE Trans. Software Eng. 1990
Distributed systems
fault tolerance
0.011990
Modeling of Hierarchical Distributed Systems with Fault-Tolerance · IEEE Trans. Software Eng. 1990
Distributed systems › distributed system architecture
hierarchical distributed systems
0.011990
Modeling of Hierarchical Distributed Systems with Fault-Tolerance · IEEE Trans. Software Eng. 1990
Performance modeling and evaluation
stochastic petri nets
0.011990
Modeling of Hierarchical Distributed Systems with Fault-Tolerance · IEEE Trans. Software Eng. 1990

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

stochastic petri nets · 0.0
YearPublicationVenuePosition
1990 Modeling of Hierarchical Distributed Systems with Fault-Tolerance
abstract
Since each of the levels in a hierarchical system could have various characteristics, different fault-tolerant schemes could be appropriate at different levels. A stochastic Petri net (SPN) is used to investigate various fault-tolerant schemes in this context. The basic SPN is augmented by parameterized subnet primitives to model the fault-tolerant schemes. Both centralized and distributed fault-tolerant schemes are considered. The two schemes are investigated by considering the individual levels in a hierarchical system independently. In the case of distributed fault tolerance, two different checkpointing strategies are considered. The first scheme is called the arbitrary checkpointing strategy. Each process in this scheme does its checkpointing independently; thus, the domino effect may occur. The second scheme is called the planned strategy. Here, process checkpointing is constrained to ensure no domino effect. The results show that, under certain conditions, an arbitrary checkpointing strategy can perform better than a planned strategy. The effect of integration on the fault-tolerant strategies of the various levels of a hierarchy are studied.>
Yuan-Bao Shieh, Dipak Ghosal, Prasad R. Chintamaneni, Satish K. Tripathi
IEEE Trans. Software Eng.3
1989 Application of Petri net models for the evaluation of fault-tolerant techniques in distributed systems
abstract
Analytical models are presented that use Petri nets for fault-tolerant schemes used in distributed systems. These models are used in the quantitative evaluation and selection of good fault-tolerant schemes for specific system configurations. Several different fault-tolerant schemes that can be modeled using Petri nets are discussed in detail. These schemes include rollback recovery with checkpointing, recovery blocks, N-version programming, and conversations. After a brief review of Petri net models, extension of the Petri net models to incorporate fault-tolerant schemes is considered. A methodology for evaluating a fault-tolerant scheme for a specific system configuration and the steps involved in building a Petri net model of a fault-tolerant system are described. The subnet primitives involved in building these models are identified and an algorithm for building the models automatically is described. Examples illustrating this extended Petri net model are discussed and numerical results are presented to show the applicability of the models.>
Yuan-Bao Shieh, Dipak Ghosal, Prasad R. Chintamaneni, Satish K. Tripathi
ICDCS3