Determining Possible Event Orders by Analyzing Sequential Traces

@article{Helmbold1993DeterminingPE,
  title={Determining Possible Event Orders by Analyzing Sequential Traces},
  author={David P. Helmbold and Charles E. McDowell and Jian-Zhong Wang},
  journal={IEEE Trans. Parallel Distrib. Syst.},
  year={1993},
  volume={4},
  pages={827-840}
}
One of the fundamental problems encountered when debugging a parallel program is determining the possible orders in which events could have occurred. Various problems, such as data races and intermittent deadlock, arise when there is insufficient synchronization between the tasks in a parallel program. A sequential trace of an execution can be misleading, as it implies additional event orderings, distorting the concurrent nature of the computation. This paper describes algorithms to generate… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

He joined Sun Microsystems, Inc

M. S. degree in computer, information science from the University of California at Santa in
1990 where he is currently a member of the technical staff. His • 1990

Automatic detection of nondeterminacy in parallel programs

D. A. Padua
Proc . Workshop Parallel and Distributed Debugging , May • 1989

Event synchronization analysis for debugging parallel programs

Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89) • 1989

P

NV Reno, Nov.
A. Emrath and D. A. Padua, “Automatic detection of nondeterminacy • 1989

R

J . Parallel, Distributed Comput., June
H. B. Netzer and B. P. Miller, “On the complexity of event ordering • 1989

Breakpoints and halting in distributed systems

J-D. Choi
Proc . Int . Conf Distributed Computing Syst • 1988

Similar Papers

Loading similar papers…