A practical approach to the symbolic debugging of parallelized code

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A practical technique is presented that supports the debugging of parallelized code through global renaming and name reclamation. Global renaming creates single assignment code for programs destined to be parallelized. After parallelization, a reclamation of names not useful for either the execution or debugging of the code is performed. During execution non-current values can then be tracked and reported to the debugger. Results of experimentation indicate the enlargement of the name space is reasonable and that virtually all non-current values are reportable. The technique is independent of the transformations chosen to parallelize the code.

Cite

CITATION STYLE

APA

Pineo, P., & Soffa, M. L. (1994). A practical approach to the symbolic debugging of parallelized code. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 786 LNCS, pp. 339–356). Springer Verlag. https://doi.org/10.1007/3-540-57877-3_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free