skip to main content
10.1145/99163.99165acmconferencesArticle/Chapter ViewAbstractPublication PagesppoppConference Proceedingsconference-collections
Article
Free Access

An empirical comparison of monitoring algorithms for access anomaly detection

Authors Info & Claims
Published:01 February 1990Publication History

ABSTRACT

One of the major disadvantages of parallel programming with shared memory is the nondeterministic behavior caused by uncoordinated access to shared variables, known as access anomalies. Monitoring program execution to detect access anomalies is a promising and relatively unexplored approach to this problem. We present a new algorithm, referred to as task recycling, for detecting anomalies, and compare it to an existing algorithm. Empirical results indicate several significant conclusions: (i) While space requirements are bounded by Ο(T × V), where T is the maximum number of threads that may potentially execute in parallel and V is the number of variable monitored, for typical programs space requirements are on average Ο(V). (ii) Task recycling is more efficient in terms of space requirements and often in performance. (iii) The general approach of monitoring to detect access anomalies is practical.

References

  1. 1.Todd R. Allen and David A. Padua. Debugging Fortran on a. Shared Memory Machine. In Proceedings of 1he International Conference on Parallel Processing, pages 721-717, Aug 1987.Google ScholarGoogle Scholar
  2. 2.David Callahan and Jaspai Subhlok. Static Analysis of Low Level Synchronization. In Proceedings on the SIGPLAN Workshop on Parallel and Distributed Debugging, pages 100-111, May 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Jong-Deok Choi, Barton P. Miller, and Robert Netzer. Techniques for Debugging Parallel Programs with Flowback Analysis. Technical Report, University of Wisconson, Aug 1988.Google ScholarGoogle Scholar
  4. 4.Anne Dinning and Edith Schonberg. Aa Evaluation of Monitoring Algorithms for Access Anomaly Detection. Technical Report Ultracornputer Note #163, New York University, July 1989.Google ScholarGoogle Scholar
  5. 5.Perry A. Emrath and David A. Padua. Automatic Detection of Nondeterminancy in Parallel Programs. In Proceedings on the SIGPLAN Workshop on Parallel and Distributed Debugging, pages 89- 99, May 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Allan Gottlieb. An Overview of the NYU Ultracomputer Project. In J.J. Dongarra, editor, Experimental Parallel Computing Architectures, pages 25 - 95, Elsevier, 1988.Google ScholarGoogle Scholar
  7. 7.Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the A CM, 21(7), Jul 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Barton P. Miller and 3ong-Deok Choi. A Mechanism for Efficient Debugging of Parallel Programs. In Proceedings on the SIGPLAN Workshop on Parallel and Distributed Debugging, May 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Itzhak Nudler and L#rry Rudolph. Iadetermiaaacy Considered Harmful. 1988.Google ScholarGoogle Scholar
  10. 10.Itzhak Nudler and Larry Rudolph. Tools for the Efficient Development of Efficient Parallel Programs. In 1#t Israeli Conference on Computer System En. gineering, 1988.Google ScholarGoogle Scholar
  11. 11.Edith Schonberg. On-The-Fly Detection of Access Anomalies. In Proceedings on the SIGPLAN Conference on Programming Language Design and Implementation, Jun 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.Marc Snir. Private correspondence. 1988.Google ScholarGoogle Scholar

Index Terms

  1. An empirical comparison of monitoring algorithms for access anomaly detection

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                PPOPP '90: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
                February 1990
                206 pages
                ISBN:0897913507
                DOI:10.1145/99163
                • Chairman:
                • David Padua
                • cover image ACM SIGPLAN Notices
                  ACM SIGPLAN Notices  Volume 25, Issue 3
                  Mar. 1990
                  216 pages
                  ISSN:0362-1340
                  EISSN:1558-1160
                  DOI:10.1145/99164
                  • Editor:
                  • David Padua
                  Issue’s Table of Contents

                Copyright © 1990 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 February 1990

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • Article

                Acceptance Rates

                Overall Acceptance Rate230of1,014submissions,23%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader