Trivedi, K. (2002). Probability and statistics with reliability, queuing, and computer science applications. Prentice Hall.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....i P.J. Shenoy, H.M. Vin: Failure recovery algorithms for multimedia servers 15 Fig. 11. Reconstructed image for N =4, 8, 12, 16 with a single disk failure i 1 state Markov chain, as shown in Fig. 10. The mean time to shutdown can be either computed analytically using the theory of Markov chains [30], or computed numerically using tools such as SHARPE [27] In the simplest case, where the array can tolerate two failures per cluster (i.e. i = 3) MTTS = MTTF 3 [D(C 1) C 2)MTTR 2 ] Thus, when D = 32, N = C = 8, and MTTR= 3 h, the MTTS is over 250 million years. To summarize, the ....

Trivedi KS (1982) Probability and Statistics With Reliability, Queuing, And Computer Science Applications. Prentice Hall, Englewood Cliffs, N.J.

....L k is the total length of rock type k from which transitions to other rock types occur. L k does not include the last layer in each borehole from which no transition takes place. A Transition Intensity Matrix (TIM) comprised of elements q km is used to describe a continuous parameter MC (Trivedi 1982, p. 362) A computation of the TIM using equation (3) for the synthetic data discussed earlier is shown in Figure 1(e) The quantity q km is informative as it is a measure of both the lithologic transition and thickness. The direct definition of q km in equation (3) is independent of Dz. ....

Trivedi, S. K. 1982 Probability and statistics with reliability, queuing, and computer science applications", Prentice-Hall, Inc.

....(1) X (2) Delta Delta Delta X (N) g be the same set, but ordered in size place. Then FX (N) x) F (x) N : 15) That is, if N samples are taken from a distribution F ( Delta) then the distribution of the largest of them is given by [F (x) N (see Order Statistics in [Feller, 1971] or [Trivedi, 1982]) For PT distributions, the expectation value of this largest member was shown by [Lipsky et al. 1996] to have the asymptotic behavior E(X (N) Gamma E(X)N 1=ff : 16) This formula is consistent with, and can be implied from the TPT distribution given by (14) as follows. Let T be the ....

....very well behaved. In the 1960 s many computer facilities did this kind of analysis, and concluded rightly that the distribution of CPU times could not be purely exponential. They then invariably fit their data to hyperexponential distributions (a weighted sum of two or more exponentials) See [Trivedi, 1982] who reproduces data from the University of Michigan. What Leland and Ott plotted instead, was the mean time remaining for those jobs greater than x. That is, they evaluated the equivalent of (4) They found that this function increased linearly with x for 5 to 6 orders of magnitude. In other ....

Trivedi, K. (1982). Probability and Statistics with Reliability, Queueing, and Computer Science Applications. Prentice-Hall, Englewood Cliffs, NJ.

....to determine the service time on the most heavily loaded disk. To precisely describe the model, let us assume that a client in the playback mode can switch to the fast forward mode at any random instant and vice versa, and that such 249 a behavior can be modeled using a two state Markov chain [17] (see Fig. 6) Let F i denote the probability of switching from playback to fast forward, and P i denote the probability of switching from fast forward to playback mode for client i as shown in the figure. If P i s and F i s denote the steadystate Markov probability of client i being in ....

....fast forward to playback mode for client i as shown in the figure. If P i s and F i s denote the steadystate Markov probability of client i being in playback and fast forward, respectively, then, using the theory of Markov chains, we get P i s = P i P i F i and F i s = F i P i F i [17]. Let the random variable X j i denote the number of blocks accessed by client i from disk j in a round. Then assuming that n # D, X j i = # 1 if client i accesses disk j 0 otherwise . 1) Clearly, X j i = 1 only if client i accesses a block from disk j during either playback or ....

[Article contains additional citation context not shown here]

Trivedi KS (1982) Probability and Statistics With Reliability, Queuing, And Computer Science Applications. Prentice-Hall, Englewood Cliffs, N.J.

No context found.

Trivedi, K. (2002). Probability and statistics with reliability, queuing, and computer science applications. Prentice Hall.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC