학술논문

A distributed Poisson approximation for preempt-resume clocked schedules
Document Type
Periodical
Source
IEEE Transactions on Communications IEEE Trans. Commun. Communications, IEEE Transactions on. 38(2):192-198 Feb, 1990
Subject
Communication, Networking and Broadcast Technologies
Clocks
Delay
Time factors
Degradation
Laboratories
Stochastic processes
Exponential distribution
Equations
Processor scheduling
Fast Fourier transforms
Language
ISSN
0090-6778
1558-0857
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.ETX