✦ LIBER ✦

Reliability analysis of a simple replicated and-fork/and-join graph

✍ Scribed by De-Ron Liang; Rong-Hong Jan

Book ID: 107918290
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 384 KB
Volume: 16
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(94)90022-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reliability analysis of replicated and-o

Reliability analysis of replicated and-or graphs

✍ Liang, De-Ron; Jan, Rong-Hong; Tripathi, Satish K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 2 views

A computation task running in distributed systems can be represented as a directed graph H(V, E) whose vertices and edges may fail with known probabilities. In this paper, we introduce a reliability measure, called the distributed task reliability, to model the reliability of such computation tasks.

RELIABILITY ANALYSIS OF MUX–DEMUX REPLIC

RELIABILITY ANALYSIS OF MUX–DEMUX REPLICATED MULTISTAGE INTERCONNECTION NETWORKS

✍ N.S. Aulakh 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

Analysis of aircraft sortie generation w

Analysis of aircraft sortie generation with the use of a fork-join queueing network model

✍ Dennis C. Dietz; Richard C. Jenkins 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB 👁 2 views

This article presents an approximate analytical method for evaluating an aircraft sortie generation process. The process is modeled as a closed network of multiserver queues and fork-join nodes that allow concurrent service activities. The model uses a variation of mean value analysis (MVA) to captu

On Colouring Partial Joins of a Complete

On Colouring Partial Joins of a Complete Graph and a Cycle

✍ M. Stiebitz; W. Wessel 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 493 KB

## Abstract Define the partial join of two graphs to be some graph arising from their disjoint union by adding a set of new edges each joining a vertex of the first graph and a vertex of the second one. We characterize all colour‐critical graphs being partial joins of a complete graph and an odd cy

A simple, reliable, and expandable monit

A simple, reliable, and expandable monitor and control system for gas-exchange analysis

✍ Donald E. Campbell 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A system of relatively low-cost but reliable components was assembled for time sharing a single analytical instrument in gas-exchange studies. Aside from an analytical instrument, recorder, gas standards, and study vessels or compartments, only a simple assembly of timers, motor-driven cams, microsw

Face Size and the Maximum Genus of a Gra

Face Size and the Maximum Genus of a Graph 1. Simple Graphs

✍ Yuanqiu Huang; Yanpei Liu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB

This paper shows that a simple graph which can be cellularly embedded on some closed surface in such a way that the size of each face does not exceed 7 is upper embeddable. This settles one of two conjectures posed by Nedela and S8 koviera (1990, in ``Topics in Combinatorics and Graph Theory,'' pp.