See this document in CiteSeerX!

Guaranteeing Hard Real Time End-to-End Communications Deadlines (1991)  (Make Corrections)  (12 citations)
K. W. Tindell A. Burns A. J. Wellings Real Time Systems Research Group...



  Home/Search   Context   Related

 
View or download:
cs.york.ac.uk/pub/real...RTRG91107.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fermivista.math...p.cs.york.ac.uk (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In a distributed hard real time system communication between tasks on different processor must occur in bounded time. The inevitable communication delay (termed the end-to-end delay) is composed from the delay in transmitting a message on the communications media, and also from the delay in delivering the data to the destination task. This paper gives schedulability analysis bounding the media access delay and the delivery delay, and hence allows the end-to-end delay for a message to be... (Update)

Context of citations to this paper:   More

...different communication protocols. The CAN bus is analyzed in [13] a 802.5 style token ring and a simple TDMA protocol are analyzed in [14], in [16] P NET networks are investigated, while in [3] the ATM protocol is considered. In this paper we consider the time triggered...

.... of a tick scheduler, or perhaps awaiting the arrival of a message) assuming the communications sub system can provide such guarantees [4], 5] Task 2 is released after the worst case message arrival time. Note that task 2 is not synchronised with the arrival of the message...

Cited by:   More
Adding Time-Offsets to Schedulability Analysis - Tindell   (Correct)
Real-Time Support on top of Ethernet - Rainer Koster And   (Correct)
A Distributed Computer Testbed for Real-Time Control of.. - Törngren, Garbergs.. (1993)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Analysis Of Hard Real-Time Communications - Tindell (1994)   (Correct)
0.2:   Resource Control For Hard Real-Time Systems: A Review - Audsley (1991)   (Correct)
0.2:   Allocating Hard Real Time Tasks + (An NP-Hard Problem Made Easy) - Ken Tindell (1992)   (Correct)

Similar documents based on text:   More   All
0.1:   End-To-End Arguments In System Design - Saltzer, Reed, Clark (1984)   (Correct)
0.1:   SCHEDULING Hard REAL-TIME Multi-Media Disk Traffic - Tindell, Burns (1993)   (Correct)
0.1:   Tight Size Bounds for Packet Headers in Narrow Meshes - Adler, Fich, Goldberg.. (2000)   (Correct)

Related documents from co-citation:   More   All
8:   Holistic schedulability analysis for distributed hard real time systems (context) - Clark, Tindell - 1994
7:   Scheduling Algorithms for Multiprogramming in a Hard Real-time Environment - Liu, Layland - 1973
6:   An Extendible Approach for Analysing Fixed Priority Hard Real-Time Tasks - Tindell, Burns et al. - 1992

BibTeX entry:   (Update)

Tindell, K. W., Burns, A. and Wellings, A. J., "Guaranteeing Hard Real Time End-to-End Communications Deadlines," RTRG/91/107, Department of Computer Science, University of York (1991). http://citeseer.ist.psu.edu/tindell91guaranteeing.html   More

@misc{ tindell91guaranteeing,
  author = "K. Tindell and A. Burns and A. Wellings",
  title = "Guaranteeing Hard Real Time End-to-End Communications Deadlines",
  text = "Tindell, K. W., Burns, A. and Wellings, A. J., Guaranteeing Hard Real Time
    End-to-End Communications Deadlines, RTRG/91/107, Department of Computer
    Science, University of York (1991).",
  year = "1991",
  url = "citeseer.ist.psu.edu/tindell91guaranteeing.html" }
Citations (may not include all citations):
1582   Scheduling Algorithms for Multiprogramming in a HardReal -Ti.. - Liu, Layland - 1973
528   Priority Inheritance Protocols: An Approach to Real-Time Syn.. (context) - Sha, Rajkumar et al. - 1990
226   The Complexity of Fixed-Priority Scheduling of Periodic Real.. (context) - Leung, Whitehead - 1982
124   Hard Real-Time Scheduling: The Deadline Monotonic Approach - Audsley, Burns et al. - 1991
74   Misconceptions About Real-Time Computing: A Serious Problem .. (context) - Stankovic - 1988
63   Optimisation by Simulated Annealing (context) - Kirkpatrick, Gelatt et al. - 1983
56   Four-Slot Fully Asynchronous Communication Mechanism (context) - Simpson - 1990
31   Deadline Monotonic Scheduling - Audsley - 1990
29   The Real-Time Operating System of MARS (context) - Damm, Reisinger et al. - 1989
28   Allocating Real-Time Tasks (An NP-Hard Problem made Easy (context) - Tindell, Burns et al.
27   Advanced Real-Time Scheduling Using the IEEE 802.5 Token Rin.. (context) - Strosnider, Marchok et al. - 1988
7   The Feasibility of Response Time Predictions - An Experiment.. - Vrchoticky, Puschner - 1991
6   Architecture Impact of FDDI Network on Scheduling Hard Real .. (context) - Agrawal, Chen et al. - 1991
6   Natural Solutions Give Their Best (context) - Radcliffe, Wilson - 1990
5   Real-Time Synchronisation Protocols for Shared Memory Multip.. (context) - Rajkumar - 1990
1   Grundlagen der Strassenverkehrsplanung in Stadt und Land (context) - Korte - 1960



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.york.ac.uk.html):   More
Feature Interactions with Dynamic Priorities - Burns, Wellings   (Correct)
Applying HAZOP to Software Engineering Models - Fenelon, Hebbron (1994)   (Correct)
Using Diagrams to give a Formal Specification of Timing.. - Coombes, McDermid   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC