Skip Navigation

The Computer Journal 2001 44(1):31-41; doi:10.1093/comjnl/44.1.31
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zhang, S.
Right arrow Articles by Burns, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Determining the Worst-case Synchronous Message Response Time in FDDI Networks

Sijing Zhang1, E. Stewart Lee2 and Alan Burns3

1 School of Mathematics and Computing, University of Derby, Kedleston Road, Derby DE22 1GB, UK Email: s.zhang@derby.ac.uk 2 Centre for Communications Systems Research, University of Cambridge, 10 Downing Street, Cambridge CB2 3DS, UK 3 Real-Time Systems Group, Department of Computer Science, University of York, Heslington, York YO1 5DD, UK

Finding the worst-case message response time is important for guaranteeing message deadlines in any hard real-time communication environment. This paper proposes an $O(n)$-time algorithm for exactly capturing the worst-case synchronous message response time in an FDDI network for any given set of synchronous message streams whose message deadlines are no longer than periods. The proposed algorithm can be used to form an optimal test on whether or not a given setting of network parameters can meet the message deadline constraints for a considered synchronous message set with deadlines no longer than periods.

Received 10 August, 1999. Revised 22 November, 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.