Subscribe
Issue No.10 - October (1988 vol.14)
pp: 1525-1535
ABSTRACT
<p>The authors describe a tool called TAP, which is defined to aid the programmer in discovering the causes of timing errors in running programs. TAP is similar to a postmortem debugger, using the history of interprocess communication to construct a timing graph, a directed graph where an edge joins node x to node y if event x directly precedes event y in time. The programmer can then use TAP to look at the graph to find the events that occurred in an unacceptable order. Because of the nondeterministic nature of distributed programs, the authors feel a history-keeping mechanism but always be active so that bugs can be dealt with as they occur. The goal is to collect enough information at run time to construct the timing graph if needed. Since it is always active, this mechanism must be efficient. The authors also describe experiments run using TAP and report the impact that TAP's history-keeping mechanism has on the running time of various distributed programs.</p>
INDEX TERMS
distributed programs; TAP; timing errors; postmortem debugger; interprocess communication; timing graph; directed graph; history-keeping mechanism; directed graphs; distributed processing; program testing; software tools
CITATION
"Handling Timing Errors in Distributed Programs", IEEE Transactions on Software Engineering, vol.14, no. 10, pp. 1525-1535, October 1988, doi:10.1109/32.6197
SEARCH