We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A set of new and efficient formulae for buffer size analysis of real-time systems using M/G/1 models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chen, T.M. ; Dept. of Electron. & Comput. Sci., Southampton Univ., UK ; Wilkins, B.R.

A set of new efficient and compact formulae for buffer size analysis of real time systems using M/G/1 queueing model has been developed. For Poisson random arrival and general service time distribution of a single server system, or an M/G/1 system, and for a certain probability of overflow as the confidence level, the needed size of buffer can be estimated. Two subsets of M/G/1 systems, namely the M/D/1 and M/Ek/1 systems, are investigated in detail to illustrate the practicality of this approach. The formulae are derived analytically and are validated using term by term evaluation. The size of buffer needed for M/D/1 and M/Ek/1 systems are tabulated for design and validation purposes. The newly derived formulae are more efficient and compact than currently known computation methods

Published in:

Real-Time Computing Systems and Applications, 1997. Proceedings., Fourth International Workshop on

Date of Conference:

27-29 Oct 1997