Name
Abstract | ||
|---|---|---|
Many telecommunication systems with time-critical requirements use a preempt-resume clocked schedule. An approximation to the ergodic distribution of the time to completion of a low-priority task is obtained by treating the priority service time distribution as the limit of compound Poisson distributions. Explicit formulas for the mean and variance that are highly accurate are given. For random clocked loads, a stochastic bound is provided for the discrepancy between the exact and approximate distributions. For deterministic clocked loads, sample path bounds are found. Simulation results are given to demonstrate the accuracy of the model |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/26.47854 | Communications, IEEE Transactions |
Keywords | Field | DocType |
queueing theory,stochastic processes,deterministic clocked loads,distributed Poisson approximation,ergodic time distribution,low priority task completion,preempt-resume clocked schedule,priority service time distribution,random clocked loads,sample path bounds,stochastic bound,telecommunication systems | Applied mathematics,Mathematical optimization,Control theory,Ergodic theory,Stochastic process,Queueing theory,Schedule,Fast Fourier transform,Sample path,Exponential distribution,Poisson distribution,Mathematics | Journal |
Volume | Issue | ISSN |
38 | 2 | 0090-6778 |
Citations | PageRank | References |
2 | 0.44 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Keilson | 1 | 81 | 58.13 |
| L. D. Servi | 2 | 134 | 19.64 |