| B. Carlson, Markovian analysis of deadline oriented queueing systems. PhD thesis, Vanderbilt University, 1991. |
....added partition, the algorithm avoids redundant computations. 3 Stepping Through an Idealized Example Following is a trace of the algorithm given the idealized time series data found in Table 1. This idealistic execution profile is used to illustrate each step in the algorithm and is taken from [6]. Examples using real execution profiles are presented in Section 4. Table 1. Time series data 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 11 12 11 12 11 12 11 12 11 12 11 12 11 12 11 12 21 22 21 22 21 22 21 22 21 22 21 22 21 22 21 22 31 32 31 32 31 32 31 32 31 32 31 32 31 32 31 32 The time series data given ....
B. Carlson, Markovian analysis of deadline oriented queueing systems. PhD thesis, Vanderbilt University, 1991.
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