• DocumentCode
    3112705
  • Title

    Real-time queueing theory

  • Author

    Lehoczky, John P.

  • Author_Institution
    Dept. of Stat., Carnegie Mellon Univ., Pittsburgh, PA, USA
  • fYear
    1996
  • fDate
    4-6 Dec 1996
  • Firstpage
    186
  • Lastpage
    195
  • Abstract
    The paper presents an approach to real time system scheduling. The approach, called real time queueing theory, includes customer timing requirements into queueing models. With real time queueing models, one is able to explicitly characterize the dynamic behavior of the customer lead time profile process where lead time=deadline minus current time. In spite of the infinite dimensionality of these processes, in the heavy traffic case, a simple description of lead time profile process is presented, and this description is shown to be very accurate when compared against simulations. Real time queueing theory offers the promise of providing real time system predictability for systems characterized by substantial stochastic behavior (such as ATM networks and multimedia systems). Possible generalizations are discussed
  • Keywords
    queueing theory; real-time systems; scheduling; ATM networks; customer lead time profile process; customer timing requirements; dynamic behavior; heavy traffic case; infinite dimensionality; lead time profile process; multimedia systems; queueing models; real time queueing theory; real time system predictability; real time system scheduling; stochastic behavior; Application software; Communication systems; Computational modeling; Dynamic scheduling; Multimedia systems; Queueing analysis; Real time systems; Statistics; Stochastic systems; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Real-Time Systems Symposium, 1996., 17th IEEE
  • Conference_Location
    Los Alamitos, CA
  • ISSN
    1052-8725
  • Print_ISBN
    0-8186-7689-2
  • Type

    conf

  • DOI
    10.1109/REAL.1996.563715
  • Filename
    563715