7 citations found. Retrieving documents...
I. J. Bate. Scheduling and Timing Analysis for Safety Critical RealTime Systems. PhD thesis, Department of Computer Science, University of York, York, YO10 5DD, 1999.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Probabilistic Analysis of CAN with Faults - Broster, Burns.. (2002)   (Correct)

....I i (t) j#hp(i) # C i J j # T j (C j S) 4) where hp(i) is the set of messages with higher priority than i and J j is the worst case release jitter of frame j. The # is used to eliminate edge effects where a high priority frame becomes ready as a medium priority one completes [2]. E i (t) is some function which returns the overhead due to faults in period t, this will be explained in section 3.3. Equation (1) may be solved iteratively i ) E i (t i ) 5) with t i = C i . Iteration terminates when t i provided t i T i J i . The final value of t i is the ....

I. J. Bate. Scheduling and Timing Analysis for Safety Critical Real-Time Systems. PhD thesis, Dept of Computer Science, University of York, York, YO10 5DD, 1999.


Architectural Considerations in the Certification of Modular.. - Bate, Kelly (2003)   (3 citations)  Self-citation (Bate)   (Correct)

No context found.

Bate I. Scheduling and timing analysis for safety-critical systems. UK: Department of Computer Science, University of York; 1998.


Flexible Design of Complex High-Integrity Systems Using Trade .. - Biswa Sengupta Iain   Self-citation (Bate)   (Correct)

No context found.

I. Bate, Scheduling and Timing Analysis of Safety Critical Hard Real Time Systems, Phd Thesis, Department of Computer Science, Univ. of York, YCST-99-04, 1999.


Unknown - British Computer Society   Self-citation (Bate)   (Correct)

No context found.

Bate, I. (1999) Scheduling and Timing Analysis for SafetyCritical Systems. DPhil Thesis, Department of Computer Science, University of York, YCST-99-04.


A Framework for Scheduling in Safety-Critical Embedded Control.. - Bate, Burns (1999)   Self-citation (Bate)   (Correct)

....on a nonpreemptive scheduling model. Also, due the reluctance of certification authorities to have any features that are consider difficult to predict, the work is based on periodic tasks. However, all the theory presented in this paper is equally applicable to a preemptive scheduling model. In [2] the standard schedulability analysis is enhanced (and proven) to suit this computational model resulting in the recurrence equations (1) 2) which terminates when R n 1 i = R n i , or R n 1 i D i , and blocking equation (3) R n 1 i = C i B i X j2hp(i) R n i J j Gamma ....

....and the distributed scheduling problem (section 4) The paper provides an overview of the techniques due to space considerations. A more complete discussion of the techniques, their origins, how other timing requirements such as separation can be satisfied, and the approach s pros and cons are in [2]. 2.2 Typical Characteristics of an Engine Controller This section is to identify the typical timing requirements for safety critical systems, which can be divided into two categories, those associated with tasks, and those associated with transactions. To give context to the work in this paper, ....

[Article contains additional citation context not shown here]

I. Bate, Scheduling and Timing Analysis for SafetyCritical Systems. PhD thesis, Department of Computer Science, University of York, November 1998.


An Approach to Task Attribute Assignment for Uniprocessor Systems - Bate, Burns   (9 citations)  Self-citation (Bate)   (Correct)

....is still useful to have analysis available that allows transactions requirements to be verified. It has been shown that it is only necessary to check the one instance of the transaction immediately after the critical instant and only in the case where all tasks execute for their worst case time [3]. Consider the timing requirements presented in Figure 1. Figure 1 illustrates a task set consisting of three tasks (A, B and C) and a single transaction requirement across all the tasks. The periods and deadlines of tasks A, B and C are 50, 100 and 50 respectively. The transaction has a period ....

....task t, R n t t , of the transaction s critical instant (i.e. time zero) is given in equation (2) When calculating transactions response times, an assumption is made that the worst case response time of a task is equal to the task s deadline. A proof of equations (1) and (2) is contained in [3]. R n t t = n t Gamma 1)T t R t (2) where R n t t is the worst case response time of the n th t instance of task t. Using an initial value of n 1 = 1, the response time of each task in the transaction can be calculated by starting with the first task and taking each task in turn. ....

[Article contains additional citation context not shown here]

I. Bate, Scheduling and Timing Analysis for SafetyCritical Systems. PhD thesis, Department of Computer Science, University of York, November 1998.


Comparing Real-time Communication under Electromagnetic.. - Ian Broster Alan (2004)   (Correct)

No context found.

I. J. Bate. Scheduling and Timing Analysis for Safety Critical RealTime Systems. PhD thesis, Department of Computer Science, University of York, York, YO10 5DD, 1999.

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