1986
DOI: 10.1002/spe.4380160304
|View full text |Cite
|
Sign up to set email alerts
|

A probe effect in concurrent programs

Abstract: This paper reports on an experimental study of the probe effect, defined as an alteration in the frequency of run-time computational errors observed when delays are introduced into concurrent programs. If the concurrent program being studied has no synchronization errors, then there is no probe effect. In the presence of synchronization errors, the frequency of observable output errors for a sample experimental program starts at a high value for small delays, oscillates rapidly as the delay is increased, and a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
37
0

Year Published

1992
1992
2017
2017

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 149 publications
(41 citation statements)
references
References 6 publications
1
37
0
Order By: Relevance
“…Indeed, tracing solutions need to be highly optimized as they should only minimally impact the monitored system, to avoid the undesired "probe effect" [9].…”
Section: Related Workmentioning
confidence: 99%
“…Indeed, tracing solutions need to be highly optimized as they should only minimally impact the monitored system, to avoid the undesired "probe effect" [9].…”
Section: Related Workmentioning
confidence: 99%
“…However, any form of observation is also an interaction -the act of testing can also affect what is being tested. In [30], Jason Gait defined the probe effect as "a characteristic behaviour of the execution trace of an incorrectly synchronized concurrent program when extraneous delays are introduced". In some situations, the presence of the debugger or the act of observation can affect some timing-related bugs in such a way that the bug disappears or the threads switch their execution order.…”
Section: Software Testing and Debuggingmentioning
confidence: 99%
“…This means, if we assume communication latencies in the interval [3,6), that task C can receive data from task instance E 2 or E 3 . In order to differentiate between these scenarios we should therefore substitute the global ordering (q1,p1) with the set (q1:C(E 2 ), p1) and (q1:C(E 3 ), p1).…”
Section: Example 3-2mentioning
confidence: 99%
“…However, trying to directly apply test techniques for sequential programs on distributed real-time systems is bound to lead to non-determinism and non-reproducibility, because control is only forced on the inputs, disregarding the significance of order and timing of the executing and communicating tasks. Any intrusive observation of a distributed real-time system will, in addition, incur a temporal probe-effect [6][18] that subsequently will affect the temporal and functional behavior of the system.…”
Section: Introductionmentioning
confidence: 99%