Referenced Items are not available for this document.
This paper discusses the problem of scheduling messages of various priority classes, and constant length, arriving at a node which transmits them into channels subject to timing constraints defined as the maximum end-to-end delay from the source to the destination. The concept of asynchronous time sharing is used in designing the scheduler for this model. The developed algorithm has been applied to the published model of the Message Broadcast System for the Superconducting Supercollider Collider and respective simulations have been conducted
Published in:
Nuclear Science, IEEE Transactions on
(Volume:41
,
Issue:
1
)
Date of Publication: Feb 1994
- Page(s):
- 213 - 215
- ISSN :
- 0018-9499
- INSPEC Accession Number:
- 4671160
- Digital Object Identifier :
- 10.1109/23.281491
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Feb 1994
- Sponsored by :
- IEEE Nuclear and Plasma Sciences Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
