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

David G. Furchtgott

dblp:02/3683 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1984
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
2 papers
Performance modeling and evaluation · 54% Hardware reliability and fault tolerance · 40% Embedded and real-time systems · 6%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
performability analysis
0.021984
A Performability Solution Method for Degradable Nonrepairable Systems · IEEE Trans. Computers 1984
Performability Evaluation of the SIFT Computer · IEEE Trans. Computers 1980
Hardware reliability and fault tolerance › fault-tolerant architecture
fault-tolerant computer
0.011980
Performability Evaluation of the SIFT Computer · IEEE Trans. Computers 1980
Hardware reliability and fault tolerance
reliability analysis
0.011980
Performability Evaluation of the SIFT Computer · IEEE Trans. Computers 1980
Information theory › probability theory
stochastic processes
0.011984
A Performability Solution Method for Degradable Nonrepairable Systems · IEEE Trans. Computers 1984
Embedded and real-time systems
cyber-physical system platforms
0.011980
Performability Evaluation of the SIFT Computer · IEEE Trans. Computers 1980

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

reward model · 0.0integral expression · 0.0stochastic processes · 0.0stochastic process · 0.0stochastic process modeling · 0.0capability function · 0.0
YearPublicationVenuePosition
1984 A Performability Solution Method for Degradable Nonrepairable Systems
abstract
An algorithm is developed for solving a broad class of performability models wherein system performance is identified with "reward." More precisely, for a system S and a utilization period T, the performance variable of the model is the reward derived from using S during T. The state behavior of S is represented by a finite-state stochastic process (the base model); reward is determined by reward rates associated with the states of the base model. Restrictions on the base model assume that the system in question is not repaired during utilization. It is also assumed that the corresponding reward model is a nonrecoverable process in the sense that a future state (reward rate) of the model cannot be greater than the present state. For this model class, we obtain a general method for determining the probability distribution function of the performance (reward) variable and, hence the performability of the corresponding system. Moreover, this is done for bounded utilization periods. The result is an integral expression which can be solved either analytically or numerically.
David G. Furchtgott, John F. Meyer
IEEE Trans. Computers1
1980 Performability Evaluation of the SIFT Computer
abstract
Performability modeling and evaluation methods are applied to the SIFT computer in the computational environment of an air transport mission. User-visible performance of the "total system" (SIFT plus its environment) is modeled as a random variable taking values in a set of "accomplishment levels." These levels are defined in terms of four attributes of total system behavior: safety, no change in mission profile, no operational penalties, and no economic penalties. The "base model" of the total system is a stochastic process whose states describe the internal structure of SIFT as well as relevant conditions of its environment. Base model state trajectories are related to accomplishment levels via a "capability function" which is formulated in terms of a three-level model hierarchy. Solution methods are then applied to determine the performability of the total system for various choices of computer and environment parameter values.
John F. Meyer, David G. Furchtgott, Liang T. Wu
IEEE Trans. Computers2