H. Thane and H. Hansson. Testing Distributed Real-Time Systems. Elsevier Microprocessors and Microsystems, February 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....There is a direct relation between the amount of jitter in the system and the number of possible execution scenarios. Many execution scenarios require larger testing e orts. Thus, the larger the jitter is, the harder it is to test the system the testability is reduced as the jitter increases [7]. There are several factors that control the amount of jitter in the system [7] Execution time jitter depends on di erences between the best case execution time and the worst case execution time of a system. Start jitter describes the jitter induced in low priority tasks as they are a ected by ....

....number of possible execution scenarios. Many execution scenarios require larger testing e orts. Thus, the larger the jitter is, the harder it is to test the system the testability is reduced as the jitter increases [7] There are several factors that control the amount of jitter in the system [7]: Execution time jitter depends on di erences between the best case execution time and the worst case execution time of a system. Start jitter describes the jitter induced in low priority tasks as they are a ected by the execution of and the execution time jitter in high priority tasks. Clock ....

Henrik Thane and Hans Hansson. Testing Distributed Real-Time Systems. Elsevier Microprocessors and Microsystems, 24(9):463 - 478, February 2001.

....because di#erent execution orderings in the system also a#ects the output and temporal behavior of the system. If the number of possible executions orderings are unknown, it may be di#cult to determine the level of confidence that can be ascribed to the system. Thane et al. discuss this problem in [57, 59, 61] where they propose a method for testing real time systems. The method describes how all possible orderings in a system can be identified, how all sequences of interleaving due to interrupts, blocking by semaphores, or scheduling decisions can be listed. They can then group a particular execution ....

Henrik Thane and Hans Hansson. Testing Distributed Real-Time Systems. Journal of Microprocessors and Microsystems, 24:463 -- 478, February 2001.

No context found.

Henrik Thane and Hans Hansson. Testing distributed real-time systems. Elsevier Microprocessors and Microsystems, 24(9):463 -- 478, February 2001.

No context found.

H. Thane and H. Hansson. Testing distributed real-time systems. In Journal of Microprocessors and Microsystems, pages 463478. Elsevier, 2001.

....20] by using adaptive logging. However, as previously published solutions make on line decisions about whether to log or not to log a monitored event originating from high perturbing software probes, there is an increase of the jitter in the system. Jitter will reduce the testability of the system [16], wherefore gains in time overhead for the logging procedure must be balanced with respect to this. It would however be possible to make certain gains with regard to memory resources required, without compromising the testability, but that would require eviction strategies such as that presented ....

.... of tasks, within which some messages can be assumed to be reproducible during replay [9] We have chosen not to exploit this fact, which may allow a reduction in the overhead from the monitoring activities, as the jitter of current technologies [9] will compromise the testability of the system [16]. 6. Related work With respect to related work in the field of replay debugging of concurrent programs and real time systems most references are quite old. Recent advancement in the field has been meagre. On the special topic of finding starting points for replay of real time systems, no ....

H. Thane and H. Hansson. Testing distributed real-time systems. Journal of Microprocessors and Microsystems, Elsevier, 24(9):463 -- 478, February 2001.

.... integration testing, real time systems, test coverage, priority ceiling emulation protocol, fixed priority scheduling, reachability analysis, determinism 1 INTRODUCTION n this paper we extend the method for achieving deterministic testing of distributed real time systems by Thane and Hansson [14][13]. They addressed task sets with recurring release patterns, executing in a distributed system, where the scheduling on each node was handled by a fixed priority driven preemptive scheduler supporting offsets. The method transformed the non deterministic distributed real time systems testing ....

....scheduled systems could yield enormous numbers of different scenarios, when subjected to preemption and jitter (execution time , communication time , and interrupt induced jitter) especially when the system is of multi rate character. In this paper we elaborate on the approach presented in [14][13] and expand the task model to also include critical sections, govemed by the Priority Ceiling Emulation Protocol (PCEP) 2] a.k.a. the immediate inheritance protocol and immediate priority ceiling protocol. Since tasks may synchronize communicate via critical sections, we will also relax Thane s ....

[Article contains additional citation context not shown here]

Thane H. and Hansson H. Testing distributed real-time systems. Journal of Microprocessors and Microsystems (24):463-478, Elsevier, 2001

No context found.

H. Thane and H. Hansson. Testing Distributed Real-Time Systems. Elsevier Microprocessors and Microsystems, February 2001.

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